Register

igate test series

• retagged by
929 views
2 2 votes
AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1 if n is the number of nodes in a AVL tree . The maximum value of n for which the difference between the minimum height and maximum height of AVL tree is <2 _________ ?

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Theory Of Computatio...Next → · Full Duplex
← Previous in category · Ace Academy Test Ser...Next in category → · Ace Test Series Data...
Position:
Show:

Related questions

3 3 votes
2 answers 2 answers
1.1k
1.1k views
jugnu1337 asked Sep 29, 2022
1,083 views
igate test series
The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Ex...
0 0 votes
2 2 answers
948
948 views
rsansiya111 asked Sep 23, 2022
948 views
igate Test Series
Rahul knows the implementation of merge sort. One day, his teacher asked him to find numbers of inversion in an array. An inversion can be defined in an array as if i < j...
6 6 votes
1 1 answer
239
239 views
GO Classes asked Jul 23
239 views
GO Classes DPP | GATE CS, DA | Data Structure | Valid BST and Valid AVL Tree
For the following three trees, choose the correct classification.Tree (a):Tree (b):Tree (c):Which option is correct?All three are valid AVL trees. Tree (a) is not a valid...
3 3 votes
1 1 answer
608
608 views
Shubham Sharma 2 asked Sep 10, 2025
608 views
UGC NET CSE | June 2025 | Part 2 | Question: 67
Which of the following trees are height balanced?Binary Search TreeAVL TreeRed-Black TreeB TreeChoose the correct answer from the options given below:$\text{I}$ and $\tex...