In _____________tree, the heights of the two child subtrees of any node differ by at most one

Options
- Binary tree
- Red black tree
- Splay tree
- AVL tree

CORRECT ANSWER : AVL tree

Discussion Board
Data Structure - AVL Tree

In AVL tree, the heights of the two child subtrees of any node differ by at most one. AVL tree is a height balanced tree. AVL tree is another balanced binary search tree. It was invented by Adelson-Velskii and Landis. It is a self-balancing binary search tree. AVL trees have a faster retrieval.

Prajakta Pandit 02-1-2017 12:27 AM

AVL tree Height

Technically it wrong maximum height of AVL tree is 1.57..
reference:
1. corman
2. Design And Analysis Of Algorithm By Udit Agarwal

Satyam 06-28-2016 04:51 AM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲