Question

Which of the following is not a height balanced tree ?
1) Binary search tree
2) Binary heap tree
3) AVL tree
4) Splay tree

Answer 1

2) Binary heap tree...

hope it helps.

Answer 2

Option (1) is correct.

A binary search tree is not a height-balanced tree.

What about a height-balanced tree :

• When nodes are added and deleted, a height balance tree (also known as a self-balancing tree) maintains the tree's and subtrees' height.

• A tree, on the other hand, is never broken. The AVL and red-black trees are both height-balanced.

• A height-balanced binary tree, also known as a balanced binary tree, is a binary tree in which the height of each node's left and right subtree differs by no more than one.

• For further information about the height of a tree, see to Tree Database Schema.