Question
In algorithms, for Binary Search Trees, both insert and delete are of time complexity [...]
O(h), where h is height of tree
^^ reason is for both insert and delete you need to parse all the way down to bottom of tree.

Question
In algorithms, for Binary Search Trees, both insert and delete are of time complexity [...]
?

Question
In algorithms, for Binary Search Trees, both insert and delete are of time complexity [...]
O(h), where h is height of tree
^^ reason is for both insert and delete you need to parse all the way down to bottom of tree.
If you want to change selection, open document below and click on "Move attachment"

#### pdf

owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p159

#### Summary

status measured difficulty not learned 37% [default] 0

No repetitions