15.1.1. Binary Search Trees¶

15.1.2. BST as a Dictionary (1)¶

15.1.3. BST as a Dictionary (2)¶

15.1.4. BST findhelp¶

Settings

Saving...
Server Error
Resubmit

15.1.5. BST inserthelp¶

Settings

Saving...
Server Error
Resubmit

15.1.6. BST deletemax¶

Settings

Saving...
Server Error
Resubmit

15.1.7. BST removehelp¶

Settings

Saving...
Server Error
Resubmit

15.1.8. .¶

.

15.1.9. BST Analysis¶

Find: \(O(d)\)

Insert: \(O(d)\)

Delete: \(O(d)\)

\(d =\) depth of the tree

\(d\) is \(O(\log n)\) if the tree is balanced.

What is the worst case cost? When?