Dark Mode

Recent questions tagged avl-tree

1 vote

0 answers

1

igate test series
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 _________ ?

jugnu1337 asked in DS Nov 1, 2022

159 views

0 votes

0 answers

2

AVL Trees
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?

Chaitanya Kale asked in Programming Oct 9, 2022

by Chaitanya Kale

144 views

0 votes

1 answer

3

Testbook Test Series

rsansiya111 asked in DS Dec 16, 2021

183 views

0 votes

0 answers

4

made easy
Given AVL tree is originally balanced. If a node is added to T1 so that height T1 becomes h+1 from h and z is the first node which is now imbalanced, Then find the height of T3? h h+1 h+2 h+3 Please someone explain the solution.

Rajat Agrawal007 asked in DS Dec 7, 2021

by Rajat Agrawal007

237 views

1 vote

1 answer

5

Self Doubt
What order should we insert the elements {1, 2. . . , 7} into an empty AVL tree so that we don’t have to perform any rotations on it ?

LRU asked in DS Nov 18, 2021

by LRU

238 views

1 vote

0 answers

6

Self Doubt
A tree with n nodes and the property that the heights of the two children of any node differ by at most 2 has O(log n) height. Please explain this statement to be true or false.

LRU asked in Algorithms Nov 18, 2021

by LRU

168 views

2 votes

2 answers

7

NIELIT 2017 July Scientist B (CS) - Section B: 7
A balance factor in AVL tree is used to check what rotation to make if all child nodes are at same level when the last rotation occurred if the tree is unbalanced

Lakshman Patel RJIT asked in DS Mar 30, 2020

by Lakshman Patel RJIT

4.1k views

17 votes

2 answers

8

GATE CSE 2020 | Question: 6
What is the worst case time complexity of inserting $n^{2}$ elements into an AVL-tree with $n$ elements initially? $\Theta (n^{4})$ $\Theta (n^{2})$ $\Theta (n^{2}\log n)$ $\Theta (n^{3})$

Arjun asked in DS Feb 12, 2020

by Arjun

9.1k views

5 votes

3 answers

9

ISRO2020-20
The minimum height of an AVL tree with $n$ nodes is $\text{Ceil } (\log_2(n+1))$ $1.44\ \log_2n$ $\text{Floor } (\log_2(n+1))$ $1.64\ \log_2n$

Satbir asked in DS Jan 13, 2020

by Satbir

4.1k views

Page:

1
2
3
4
next »

Recent questions tagged avl-tree