Lecture 280:- Program to Create Binary Tree

Below is a complete C++ program to create a binary tree and perform an inorder traversal to verify the created binary tree:

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; }

This program creates a binary tree using an array of integers (arr). The insert function inserts elements into the binary tree while maintaining the binary search tree property. The createBinaryTree function creates the binary tree by calling the insert function for each element in the array. Finally, the inorderTraversal function performs an inorder traversal of the binary tree and prints the nodes in ascending order.

You can customize the arr array to create different binary trees and verify them using the inorder traversal. Remember to free the allocated memory for the nodes after use to avoid memory leaks.