in DS recategorized by
118 views
1 vote
1 vote

When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:

  1. Heap tree
  2. almost complete binary tree
  3. Binary search tree
  4. Cannot be determined
in DS recategorized by
by
118 views

1 Answer

0 votes
0 votes
option C as one of the very basic characteristics of binary search tree.
Answer:

Related questions