See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
15 questions from this quiz
A hierarchical data structure of nodes
The topmost node
A node with no children
A connection between parent and child
At most two
Left child
Nodes can have more than two children
O(logn)O(\log n)O(logn)
2i+12i + 12i+1
2i+22i + 22i+2
Left → Right → Root
D → E → B → C → A
Level by level, left to right
Replace with in-order successor
O(n)O(n)O(n)
Select your subjects, and get access to A+ resources today.