Register

Testbook Test Series

• recategorized by
793 views

2 Answers

2 2 votes
For an AVL tree, always note that the height of the left subtree and the height of the right sub tree should differ by atmost 1. Hence option D.
0 0 votes

| Height of left subtree - height of right subtree |  <= 1
D

Voting & Accepting an answer helps improve the community
← Previous · Computer System Arch...Next → · Testbook Test Series
← Previous in category · Testbook Test SeriesNext in category → · Testbook Test Series
Position:
Show:

Related questions

2 2 votes
0 0 answers
529
529 views
Rajat Agrawal007 asked Dec 4, 2021
529 views
TestBook
In a Binary Search Tree, a key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9 not necessary in the same order. Lets P is the probability that ...
0 0 votes
1 1 answer
1.2k
1.2k views
Magma asked Dec 27, 2018
1,203 views
Testbook Test Series: Programming & DS - Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
1 1 vote
0 0 answers
2.7k
2.7k views
vinay chauhan asked Oct 31, 2018
2,713 views
Testbook Test Series: Programming & DS - Hashing
The keys 44, 63, 29, 78, 23, 6, 81, 14, 13, 12 and 52 are inserted into an initially empty hash table of length 12 using linear probing with hash function h(k)= k mod 12....
0 0 votes
0 0 answers
1.4k
1.4k views
sidlewis asked Sep 1, 2018
1,359 views
Testbook Test Series: Programming & DS - Binary Search Trees