Dark Mode

Recent questions tagged avl-tree

3 votes

1 answer

1

GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 36
Let $\mathrm{T}$ be the smallest AVL tree of height $h$. How many nodes does it have, if the smallest AVL tree of height $h-2$ has $m$ nodes and the smallest AVL tree of height $h-3$ has $k$ nodes? $m+k+2$ $m+2 k$ $2 m+k$ $2 m+k+2$

GO Classes asked in DS Jan 28

342 views

1 vote

1 answer

2

Suppose a BST is converted into an AVL tree. Which of the following statements is correct?
Suppose a BST is converted into an AVL tree. Which of the following statements is correct? a. The in-order traversal of the AVL tree and the BST will be the same. b. The pre-order traversal of the AVL tree and ... c. The post-order traversal of the AVL tree and the BST will be the same. d. None of the above.

dhruba asked in Algorithms Jun 5, 2023

by dhruba

566 views

0 votes

1 answer

3

Practice question Avl trees
S1 : An insertion in an AVL with n nodes requires O(n) rotations. answer is false in answer key,but is guess for 1 insetion its O(1).so for n it will be O(n). tell me if i am wrong and correct me please.

Ujjaval251 asked in Programming in C Mar 14, 2023

934 views

2 votes

0 answers

4

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

481 views

1 vote

0 answers

5

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 in C Oct 9, 2022

by Chaitanya Kale

396 views

0 votes

1 answer

6

Testbook Test Series

rsansiya111 asked in DS Dec 16, 2021

373 views

0 votes

0 answers

7

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 6, 2021

by Rajat Agrawal007

375 views

2 votes

0 answers

8

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

274 views

Page:

1
2
3
4
next »

Recent questions tagged avl-tree