Question Authoring Studio
Compose questions with live KaTeX rendering and direct diagram uploads.
Topic ID
Question Type
MCQ (Single Correct)
MSQ (Multiple Correct)
NAT (Numerical Answer)
Question Statement
+ Attach Diagram
Consider the following AVL tree: $$T = \text{balanced binary search tree}$$ What is the height balance factor of the root node?
Options
A.
B.
C.
D.
Correct Option Key(s) (e.g. "B" or "A, C")
Detailed Solution
The balance factor is calculated as $\text{height}(left) - \text{height}(right)$.
Publish Question to Bank
Live Preview
MCQ
Consider the following AVL tree:
T
=
balanced binary search tree
T = \text{balanced binary search tree}
T
=
balanced binary search tree
What is the height balance factor of the root node?
Options
A
0
0
0
B
+
1
+1
+
1
C
−
1
-1
−
1
D
±
2
\pm 2
±
2
Solution Derivation
The balance factor is calculated as
height
(
l
e
f
t
)
−
height
(
r
i
g
h
t
)
\text{height}(left) - \text{height}(right)
height
(
l
e
f
t
)
−
height
(
r
i
g
h
t
)
.