What operation does the following BST algorithm describe?Algorithm aBSTAlgorithm (root, targetKey) if (empty tree) return null end if if (targetKey < root) return aBSTAlgorithm (left subtree, targetKey) else if (targetKey > root) return aBSTAlgorithm (right subtree, targetKey) else return root end ifend aBSTAlgorithm
A. inorder traversal
B. find the smallest node
C. find the largest node
D. find a requested node
Answer: D
Computer Science & Information Technology
You might also like to view...
A good font size for the general page content is ____ pixels when viewed on a screen.
A. 9 B. 10 C. 14 D. 18
Computer Science & Information Technology
The results of a mail merge can be viewed from the ________ tab
A) Mailings B) Review C) Home D) Insert
Computer Science & Information Technology
Which term does a user of a relational database use to refer to a record?
A. row B. table C. column D. attribute
Computer Science & Information Technology
What subject area is not one of the 22 domains tested during the CEH exam?
A. Sniffers B. Social engineering C. Footprinting D. Trojan hijacking
Computer Science & Information Technology