Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

Programming and data structure miscellaneous

Programming & Data Structure

  1. What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.
    1. 2
    2. 3
    3. 4
    4. 5
Correct Option: B

AVL trees are binary trees with the following restrictions.
(1) the height difference of the children is at most 1.
(2) both children are AVL trees



Your comments will be displayed only after manual approval.