Given a search key k and a node v of a binary search tree T, drag and drop the p

Question

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 the find(k) operation: If a search key k is less than the key stored at node v, then the search continues in the . 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 . Drag and drop the proper big O into each statement below about the running time of searching in a binary search tree T (each node with a distinct key) with height h: Time spent per node in the search is . Searching a key on the binary tree with height h runs in time. An inorder traversal of the nodes of a binary search tree visits the keys in non-decreasing order. Select one: True False

Explanation / Answer

if a serch key k is less than the key stored at node v, then the search continues in left subtree

if a serch key k is less than the key stored at node v, then the search continues will terminated

if a serch key k is less than the key stored at node v, then the search continues in right sub tree

time spent per node in the search is O(1)

searching a key on the binary tree with height h runs in O(h) time

an inorder traveral of nodes of a binary search tree visits the keys in non decreasing order is true

the inorder traversal prints the node in ascending order

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.