A

Admin • 833.24K Points
Coach

Q. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

  • (A) avl tree
  • (B) red-black tree
  • (C) lemma tree
  • (D) none of the above

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.