In binary search tree which traversal is used for getting ascending order values-InorderPost order,Preorder

Inorder
  • Interview Candidate
  • 6
  • 9810

  
Showing Answers 1 - 6 of 6 Answers

Sai Kumar

  • Jan 26th, 2016
 

Inorder Traversal: To traverse a binary tree in Inorder, following operations are carried-out (i) Traverse the left most subtree starting at the left external node, (ii) Visit the root, and (iii) Traverse the right subtree starting at the left external node.
Therefore, the Inorder traversal of the above tree will outputs:

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

  Was this answer useful?  Yes

pavithra

  • May 26th, 2016
 

Preorder

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions