6,587 views
3 votes
3 votes

In which tree, for every node the height of its left subtree and right subtree differ almost by 1?

  1. Binary Search Tree
  2. AVL Tree
  3. Threaded Binary Tree
  4. Complete Binary Tree

2 Answers

7 votes
7 votes

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right sub-trees cannot be more than one for all nodes.

Hence,Option(B) AVL Tree is the correct choice.

2 votes
2 votes
Although by definition of AVL tree(or height balance tree) right ans is B .But i think same property also holds for complete binary tree

as from a full binary tree if we start removing elements from  the right most child we will always get a tree which is height balanced

any expert comments if i am wrong
Answer:

Related questions

2 votes
2 votes
1 answer
1
im.raj asked Jun 16, 2016
5,352 views
The worst case time complexity of AVL is tree is better in comparison to binary search tree forSearch and Insert OperationsSearch and Delete OperationsInsert and Delete O...
1 votes
1 votes
1 answer
3
go_editor asked Jul 11, 2016
4,622 views
Consider the tree given below:Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree:d & hc & kg, b, c, h, i, mc & h
0 votes
0 votes
2 answers
4
go_editor asked Jul 11, 2016
4,888 views
Given an empty stack, after performing push(1), push(2), pop, push(3), push(4), pop, pop, push(5), pop, what is the value of the top of the stack?4321