Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
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
by
jugnu1337
159
views
i-gate-test-series
programming
binary-search-tree
avl-tree
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
avl-tree
data-structures
time-complexity
0
votes
1
answer
3
Testbook Test Series
rsansiya111
asked
in
DS
Dec 16, 2021
by
rsansiya111
183
views
data-structures
avl-tree
testbook-test-series
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
made-easy-test-series
data-structures
avl-tree
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
data-structures
avl-tree
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
algorithms
tree
avl-tree
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
nielit2017july-scientistb-cs
data-structures
avl-tree
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
gatecse-2020
binary-tree
avl-tree
1-mark
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
isro-2020
data-structures
avl-tree
normal
Page:
1
2
3
4
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
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 Posts
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent questions tagged avl-tree
Recent Blog Comments
What's the answer for keystroke question
Same,easy to moderate
I felt paper was very much like AIMT 3!!
very easy paper, I don't want to discuss paper...
the paper was easy to moderate, in this paper...