Question

a function that prints the binary search tree’s all nodes level by level, output statement

50, 30, 70, 20, 40, 60, 80

          50 
        /   \ 
        30   70 
       / \   / \ 
      20 40 60 80

  

  

Answer 1

HERE IS THE IMPLEMENTATION OF THE FUNCTION IN C++

2 4 1 //function defination void print_tree(struct node *root) 3. { //if node is null than return if(root==NULL) 5 return; 6 else 7 - { //print left child first than right child if (root.left !=NULL) cout<<root.left.data< < if (root.right !=NULL) cout<<root.right.data<< 1/call Left child first and than right child 14 print_tree(root.left); print_tree(root.right); 16 return; } 18 } 8 9 10 11 12 13 15 17

HERE IS THE CODE

//function defination
void print_tree(struct node *root)
{ //if node is null than return
if(root==NULL)
return;
else
{
//print left child first than right child
if (root.left!=NULL)
cout<<root.left.data<<" ";
if (root.right!=NULL)
cout<<root.right.data<<" ";
//call left child first and than right child
print_tree(root.left);
print_tree(root.right);
return;
}
}