Not undertstanding the code

#1

void print_binary_tree(node*root)
{
if(root==NULL)
return;

cout<<root->data<<" ";
print_binary_tree(root->left);
print_binary_tree(root->right);

}

in this function, will you please tell me which line is execute when

#2

This is a simple preorder traversal.
Which follows the order root -> left child -> right child
Take some example case, and track how recursion is working.

1 Like
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.