recategorized by
939 views
2 votes
2 votes

In binary search tree which traversal is used for getting ascending order values ?

  1. Inorder
  2. Preorder
  3. Postorder
  4. None of the options
recategorized by

2 Answers

2 votes
2 votes
For Binary Search Tree, Inorder gives keys in ascending order.

So A is correct.
Answer:

Related questions

2 votes
2 votes
2 answers
2
admin asked Mar 31, 2020
2,958 views
In a full binary tree number of nodes is $63$ then the height of the tree is :$2$$4$$3$$6$
2 votes
2 votes
1 answer
3
admin asked Mar 31, 2020
4,356 views
The address field of linked list : Contain address of next node May contain null characterContain address of next pointerBoth $\left (A \right)$ and $\left ( B \right)$