Question

If we traverse a binary search tree, in which manner that we get in ascending manner ___________.

• A. Inorder
• B. Preorder
• C. Postorder
• D. Graph

Answer 1

The correct option is A Inorder

If we traverse a binary search tree, in Inorder manner that we get in ascending manner.

Binary search tree:-

In a binary search tree, all the nodes in left sub tree of any node contains smaller values and all the nodes in right sub tree of that contains larger values.