data); func(ptr->left); func(ptr->right); } The above function computes the :-"> data); func(ptr->left); func(ptr->right); } The above function computes the :-">

int func(struct node *ptr) { if(ptr==NULL) return; printf("%d",ptr->data); func(ptr->left); func(ptr->right); } The above function computes the :-

  1. Home

Question:int func(struct node *ptr) { if(ptr==NULL) return; printf("%d",ptr->data); func(ptr->left); func(ptr->right); } The above function computes the :-

1.Postorder of BST

2.Inorder of BST

3.Preorder of BST

4.All of the above

Posted by R4R Team
  1. int func(struct node *ptr) { if(ptr==NULL) return; printf("%d",ptr->data); func(ptr->left); func(ptr->right); } The above function computes the :-
Search
R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!