1/8
Looks like no tags are added yet.
Name | Mastery | Learn | Test | Matching | Spaced |
---|
No study sessions yet.
get() - Balanced Tree TC
O(logn)
remove() - Balanced Tree TC
O(logn)
put() - Balanced Tree TC
O(logn)
Worst Structure of a Tree TC
Height = O(n)
Best Structure of Tree
Height = O(logn)
Binary Search (Array) TC
Best Case - O(1)
Average, Best Case - O(logn)
get() - Unbalanced Tree TC
O(n)
put() - Unbalanced Tree TC
O(n)
remove() - Unbalanced Tree TC
O(n)