I have written everything just tell me about the print function

#1

I have written everything just tell me about the print function

#2

@anmolaggarwal.432 in the given example, the tree formed is:

     1
    /
  2
 /
3

The print function is:

  1. do preorder traversal (root, left, right)
  2. when printing the content of the root node, the format is
    root->left->value => root->value <= root->right->value
  3. If the left or right child is NULL, print END instead of its value
#3
#4

try to write the print function according to the algorithm i mentioned above

#5

Please teach me how to debug

#6

Have a look at this , i rewrote the print function https://ide.codingblocks.com/s/596526

#7

Thank you done everything got cleared

#8

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.