What is Binary Tree?
A tree is said to be a binary tree if each node of the tree can have maximum of two children. Children of a node of binary tree are ordered. One child is called “left” child and the other is called “right” child. An example of binary tree is shown in below diagram.
Creation of Binary Tree Using Recursion
A binary tree can be created recursively. The program will work as follow:
1. Read a data in x.
2. Allocate memory for a new node and store the address in pointer p.
3. Store the data x in the node p.
4. Recursively create the left subtree of p and make it the left child of p.
5. Recursively create the right subtree of p and make it the right child of p.
Also Read: C++ program to create Facebook Login screen
The program is written in C language which allows linked representation of binary tree. Code will be as follow:
typedef struct node
struct node *left;
struct node *right;
printf(“Enter data(-1 for no data):”);
printf(“Enter left child of %d:n”,x);
printf(“Enter right child of %d:n”,x);
void preorder(node *t) //address of root node is passed in t
printf(“n%d”,t->data); //visit the root
preorder(t->left); //preorder traversal on left subtree
preorder(t->right); //preorder traversal om right subtree
printf(“nThe preorder traversal of tree is:n”);
In the above program I have used preorder traversal to just show that the tree is created properly or not. You can use any other traversal method here.