Inorder traversal of the binary search tree 50 30 90 12 40 86 100 is
Answers
Answered by
0
Answer:
12 30 40 50 36 90 100
Explanation:
In data structure binary search tree is also called as sorted tree. It follows an unique property of storing value in each node.
In order Traversal is used to calculate nodes in the decreasing order that is non increasing order.
In order Traversal Uses three steps to calculate:
* Left
* Root
* Right
The above tree is also separated or calculated using the steps.
Similar questions