>_
SWE Maxx
Questions
Quizzes
Daily challenge
System design
My attempts
Sign in
☀
☾
Light mode
Dark mode
Loading question…
Sign in
Which self-balancing search tree maintains a height difference of at most one at every node? | SWE Maxx
← Question bank
Data structures · Multiple Choice
Difficulty: Hard
Which self-balancing search tree maintains a height difference of at most one at every node?
Search trees
Ordered lookup
Choose your answer
A
B+ tree
B
AVL tree
C
Red-black tree
D
B-tree
Check answer
More in Data structures →