









Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
An analysis of the running time for various operations on a Binary Search Tree (BST), including find, insert, delete, and traverse. It also discusses the concept of height balance and the impact of data insertion order on the height of the tree. The document also mentions the redo policy for CS 225 students and the functional data structures in Clojure for the honors section.
Typology: Exercises
1 / 17
This page cannot be seen from the preview
Don't miss anything!
October 4 – BST Remove
MP Redo
one the code in your repo on the last day of class December 8
th
. The
redo will change you grade to the following.
Max(old_grade, .90 * new_grade)
template<typename K, typename V>
*________________________ _remove(TreeNode & root, const K & key) {
}
1 2 3 4 5 6 7 8 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
root
remove(40);
remove(10);
remove(13);
BST Analysis
BST Analysis
A
S X
2
22
2 5
BST Analysis
BST Analysis
BST Analysis – Running Time
Operation
Height-Balanced Tree
5 9
7
7
5
9