Recent questions tagged avl-tree

+1 vote

2 answers

1

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

asked Jan 13 in DS by Satbir Boss (24.2k points) | 328 views

0 votes

0 answers

2

AVL Tree Balancing
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY

asked Apr 13, 2019 in DS by kd..... Junior (861 points) | 56 views

+1 vote

1 answer

3

ME Test series Question on AVL Tree

asked Jan 19, 2019 in Algorithms by Shankar Kakde (195 points) | 101 views

0 votes

0 answers

4

MadeEasy Test Series: Programming & DS - Binary Search Tree

asked Jan 2, 2019 in Programming by CHïntän ÞäTël (217 points) | 88 views

0 votes

1 answer

5

avl tree
what is the maximum possible hight of AVL tree with 54 node? is there any general method to solve this question?

asked Dec 28, 2018 in DS by Rahul_Rathod_ (431 points) | 168 views

0 votes

1 answer

6

AVL Tree
The minimum number of node in an AVL Tree of height $10$ is ____________

asked Nov 6, 2018 in DS by Lakshman Patel RJIT Veteran (59.3k points) | 92 views

0 votes

0 answers

7

AVL TREES
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpful Thanks

asked Nov 2, 2018 in Programming by Mayankprakash Active (1k points) | 76 views

+5 votes

2 answers

8

AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.

asked Sep 15, 2018 in Algorithms by syncronizing Junior (835 points) | 980 views

0 votes

1 answer

9

AVL tree
How to solve question of the following type without creating a tree for each given option. Which of the following order of elements are inserted into an empty AVL tree so that it is possible to get the above AVL tree. A. 94,71,86,25,98,83,27,90 B 98,94,90,83,86,25,71,27 C. 86,25,98,83,27,90,71,94 D. None of these

asked Aug 27, 2018 in DS by hrcule (209 points) | 109 views

0 votes

1 answer

10

AVL tree
Consider following statements: S1: Rotation operation in AVL always preserves the Inorder ordering. S2: The median of all elements in AVL tree is always at root or one of its two children. S3: If every node in BST has either 0 or 2 children,then searching is O(logn) S4: In a 3 array tree. If number of internal node is 20 then number of Leaves are 41. True Statements ? Ans: Only S1 and S4

asked Aug 21, 2018 in DS by Na462 Loyal (7k points) | 394 views

+1 vote

1 answer

11

AVL Tree
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required for an unsuccessful search. Then what is the relation between Sn, Un and n

asked Jul 16, 2018 in Programming by hrcule (209 points) | 567 views

0 votes

1 answer

12

AVL Tree
Minimum number of internal nodes in an AVL tree with height 5? Please give a standard procedure that can be applied to larger heights as well. I know the formula: S(h) = S(h-1) + S(h-2) + 1, but here it is asked for internal nodes only. Drawing a tree is tedious.

asked May 15, 2018 in DS by Akhilesh Singla Loyal (5.4k points) | 158 views

+2 votes

1 answer

13

AVL tree
Consider the following elements inserted into an empty AVL tree in the following order 25, 10, 15, 17, 30, 35, 40, 21, 28 If [L(d)] be the sum of elements on left side of root and (Rd) be the sum of elements on right side of root, then the value of [(Rd) – (Ld) + Root] is ________.

asked Mar 11, 2018 in DS by pankaj_vir Boss (10.8k points) | 141 views

+2 votes

2 answers

14

wooe test
In what order we should insert the following elements into an empty AVL tree so that we don’t have to perform any rotation on it. 1, 2, 3, 4, 5, 6, 7 A. 4, 2, 1, 6, 3, 5, 7 B. 4, 2, 6, 1, 3, 5, 7 C. 6, 4, 5, 7, 1, 2, 3 D. 4, 5, 3, 2, 1, 6, 7

asked Mar 10, 2018 in DS by pankaj_vir Boss (10.8k points) | 334 views

0 votes

0 answers

15

#Data Structure
I was asked sometime ago in an interview draw generalised form of AVL tree that will contain all four rotations of AVL tree. I got confused I tried to explain them such notations one by one by drawing a tree on the board but they insisted me of some generalised form. Kindly help

asked Feb 19, 2018 in DS by Khursheed Bhat (25 points) | 108 views

0 votes

2 answers

16

Test Series
Delete the key sequence [6,5,4] from the below AVL tree. How many rotations are needed to make it balanced AVL tree again?

asked Jan 31, 2018 in DS by Meghaaa2612 (13 points) | 142 views

+1 vote

1 answer

17

AVL Tree
Suppose we have an AVL tree of n nodes and any change in the tree violates the AVL tree property then :- S1: If we insert an element in the tree, maximum 2 Rotations are required to make the Tree AVL again. S2: If we delete an element from the tree, maximum 2 Rotations are required to make tree AVL again Which are correct statements?

asked Jan 28, 2018 in DS by gauravkc Loyal (7.8k points) | 110 views

+1 vote

1 answer

18

Gate model paper
Here 1LR + 1RL Rotation Then how many total rotation in avl tree ? LR/RL rotation count as 2or1 rotation? Please provide detailed answer.

asked Jan 23, 2018 in Programming by Harikesh Kumar Junior (875 points) | 56 views

+3 votes

0 answers

19

AVL tree deletion
When node 50 will be deleted, what will be resultant AVL tree?

asked Jan 10, 2018 in Programming by AnilGoudar Active (4.4k points) | 517 views

+3 votes

1 answer

20

INSERTION IN AVL
Which of the following is highest upper bound that represents the time complexity of inserting an object into AVL tree with n-nodes. It must be 0(logn) right. What would be answer if it asked that element is continuously inserting in to a AVL tree.

asked Dec 19, 2017 in Algorithms by junaid ahmad Loyal (8.6k points) | 242 views

0 votes

2 answers

21

AVL tree rotations

asked Nov 29, 2017 in DS by Parshu gate Active (3.1k points) | 161 views

0 votes

3 answers

22

MadeEasy Subject Test: Programming & DS - Trees

asked Nov 17, 2017 in DS by charul Junior (823 points) | 102 views

+1 vote

2 answers

23

AVL tree
Please provide a step by step solution to this problem. Create an AVL tree for the nodes A,Z,B,C,X,D,E. The number of leaves in the resultant tree is____________.

asked Nov 15, 2017 in DS by Parshu gate Active (3.1k points) | 218 views

+4 votes

1 answer

24

Height Balanced Tree
Given numbers from {1,2,...7} then in how many ways an AVL tree be formed without any rotation required ______________.

asked Nov 3, 2017 in Programming by shivangi5 Active (1.2k points) | 446 views

+2 votes

1 answer

25

AVL tree
State If True or False. Give reason too Inserting in an AVL tree with n nodes requires $\Theta \left ( log n \right )$ rotations

asked Sep 15, 2017 in Algorithms by srestha Veteran (119k points) | 166 views

+2 votes

0 answers

26

New Gradiance
How to approach this problem ? what does "right rotation at K" mean ? is it LR

asked Aug 1, 2017 in DS by Syedarshadali (397 points) | 126 views

+2 votes

1 answer

27

Max Possible height in AVL Tree
What is the max possible height of an AVL tree with 20 nodes? a. 4 b.5 c.6 d.7 In my opinion answer should be b.5 because height of a tree with 1 node is 0 not 1, and recurrence relation to calculate maximum height of an AVL tree is: T(H) = T(H-1) + T(H-2) + 1

asked Jul 27, 2017 in Programming by Manu Thakur Boss (44.2k points) | 1.3k views

0 votes

3 answers

28

Data Structures AVL Tree
Which sequence If inserted in AVL tree will cause No adjustment in tree? a) 1 2 3 4 5 b) 5 4 3 2 1 c) 3 2 4 1 5 d) 4 3 1 2 5

asked May 9, 2017 in Programming by slowpoke (59 points) | 199 views

+1 vote

0 answers

29

Gatebook_Mocktest2(DS)
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such that|x-y| ≤ |xi-y| for all xi in the current set. Let where denotes the worst-case time ... to use in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree

asked Feb 8, 2017 in DS by smartmeet Active (4.9k points) | 112 views

0 votes

1 answer

30

GateBook Mock Test_2(Data Structure)
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such that|x-y| ≤ |xi-y| for all xi in the current set. Let where denotes the ... use in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree

asked Feb 7, 2017 in DS by smartmeet Active (4.9k points) | 137 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions tagged avl-tree

Recent Posts

Recent Blog Comments