See what we can offer to your school
"SimpleStudy just makes sense...”
Get the best plan for your school
15 cards from this deck
Hierarchical structure consisting of nodes
Topmost node in tree
Node with no children
Each node has at most two children (left and right)
Left child < parent, right child > parent
O(logn)O(\log n)O(logn)
2∗i+12*i + 12∗i+1
2∗i+22*i + 22∗i+2
Left subtree → Right subtree → Root
Level by level, left to right
Start at root, traverse left if smaller/right if larger, insert at leaf
Remove it directly
Replace it with its child
Replace with in-order successor (smallest in right subtree)
Degrades to O(n)O(n)O(n)
Select your subjects, and get access to A+ resources today.