A BST whose left and right subtree differ in height

0

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ______.
A. AVL tree
B. Red-black tree
C. Lemma tree
D. None of the above

Ravi Garg edited question
    0
    Sumit Kumar Nager (anonymous)

    The answer is A

    Sumit Kumar Nager answered
      Add image to editor add image from link

      Question stats

      • Active
      • Views1848 times
      • Answers1 answer
      • Followers1 follower
      Question and answer is powered by AnsPress