Please, answer question 1, 2, 3: Given a search key k and a node v of a binary s

Question

Please, answer question 1, 2, 3:

Given a search key k and a node v of a binary search tree T, drag and drop the proper action to each condition occurring in Question 1 Not yet answered the find(k) operation Points out of 3.00 f a search key k is less than the key stored at node v, then the search continues in the P Flag question If a search key k is equal to the key stored at node v, then the search If a search key k is greater than the key stored at node v, then the search continues in the right subtree terminates left subtree

Explanation / Answer

1) left subtree
terminates
right subtree


2) Time spent per node is O(1)
Searching with height h is O(h)

3) True it gives the nodes in ascending order



Thanks, let me know if there is any concern

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---