Vidyalelo
Data Structure · Q140

Binary Search Trees(B Tree)

Programming · Data Structure · question 140

Q140

Why we need to a binary tree which is height balanced?

A.
to avoid formation of skew trees
Answer
B.
to save memory
C.
to attain faster memory access
D.
to simplify storing

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board