Aptitude
Reasoning
Verbal
Technical
AI
Exams
Search
Technical
/
Data Structures
/
Exercises
/
Exercise 6
Data Structures
hard
0/15 answered
Q1
In a treap (tree + heap), what ensures the tree remains balanced?
A
Rotations on every insert
B
Random priorities assigned to nodes
C
AVL balancing factor
D
Red-black coloring rules
← Prev
1 / 15
Next →
← Exercise 5
Exercise 6 of 7
Exercise 7 →