Prepare
Practice
Interview
Aptitude
Reasoning
English
GD
Placement papers
HR
Current affairs
Engineering
MCA
MBA
Online test
Login
Balance factor of any node of an AVL tree - Data Structure
Home
>>
Category
>>
Programming Language (MCQ) questions
>>
Data Structure
Q. Data Structure: Which amongst the following cannot be a balance factor of any node of an AVL tree?
- Published on 19 Oct 15
a.
0
b.
1
c.
–1
d.
2
ANSWER: 2
Related Content
Networking (
207
)
Database (
97
)
C programming (
58
)
Software Engineering (
28
)
SQL (
5
)
HTML (
74
)
Web Technologies (
11
)
Data Structure (
140
)
Operating System (
96
)
Java (
25
)
Oracle (
5
)
C++ (
50
)
Algorithms (
7
)
PL/SQL (
13
)
JavaScript (
7
)
XML (
0
)
CSS (
1
)
Discussion
Nihal
-Posted on 01 Apr 16
According to given question, 2 cannot be a balance factor of any node of an AVL tree. AVL tree is also called as
balanced binary search tree.
Each node of an AVL tree has a balance factor.
The balance factor of a binary tree is the difference in heights of its two subtrees (Left and right subtree). The balance factor of a height balanced binary tree may take one of the values -1, 0, +1.
➨
Post your comment / Share knowledge
Required!
Required!
Invalid Email Id!
Required!
Enter the code shown above:
Please enter the code shown above
(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)
MCQs
English
Tutorials
Download
▲