Lecture 279:- Creating Binary Tree

Creating a binary tree involves creating nodes and connecting them in a specific way to form a tree structure. Each node in the binary tree has data and two pointers, one for the left child and one for the right child. Here's a simple implementation to create a binary tree in C++:

cppCopy code

#include <iostream> struct Node {    int data;    Node* left;    Node* right;    Node(int val) {        data = val;        left = nullptr;        right = nullptr;    } }; // Function to insert a new node into the binary tree void insert(Node* &root, int val) {    if (root == nullptr) {        root = new Node(val);        return;    }    if (val < root->data)        insert(root->left, val);    else        insert(root->right, val); } // Function to create the binary tree Node* createBinaryTree(int arr[], int n) {    Node* root = nullptr;    for (int i = 0; i < n; i++) {        insert(root, arr[i]);    }    return root; } // Function to perform inorder traversal for verification void inorderTraversal(Node* root) {    if (root) {        inorderTraversal(root->left);        std::cout << root->data << " ";        inorderTraversal(root->right);    } } int main() {    int arr[] = {5, 2, 8, 1, 3, 7, 9};    Node* root = createBinaryTree(arr, sizeof(arr) / sizeof(arr[0]));    // Verify the created binary tree by performing inorder traversal    std::cout << "Inorder Traversal: ";    inorderTraversal(root);    std::cout << std::endl;    // Remember to free the allocated memory after use to avoid memory leaks.    // (This is not included in this example for simplicity.)    return 0; }

In this example, we first define the Node structure to represent the nodes of the binary tree. Then, we have a function insert to insert a new value into the binary tree following the binary search tree property (smaller values on the left, larger values on the right). The function createBinaryTree takes an array of integers and creates the binary tree by repeatedly inserting elements from the array.

Finally, we use the inorderTraversal function to verify the created binary tree by performing an inorder traversal and printing the nodes in ascending order.

Please note that in practice, you would need to handle edge cases, memory management, and additional tree operations to build a fully functional and robust binary tree data structure.