Question: Propose an ecient algorithm for the following problem. Given a binary search tree (BST) T and a value v, your algorithm should return the number
Propose an ecient algorithm for the following problem. Given a binary search tree (BST) T and a value v, your algorithm should return the number of elements in T which are v. Justify its runtime.
(b)Prove the correctness of your algorithm. (Hint: you may add a eld size that keeps track of the number of nodes in T.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
