The following algorithm is a(n) ____ .
If the tree is empty
Return null (target is not found).
Else if the target matches the root node's data
Return the data stored at the root node.
Else if the target is less than the root node's data
Return the result of searching the left subtree of the root.
Else
Return the result of searching the right subtree of the root.
A) algorithm for removal from a heap
B) algorithm for insertion into a heap
C) algoithm for insertion intoa a binary tree
D) recursive algorithm for searching a binary tree

Question

Quizplus · Accepted Answer

This algorithm describes a recursive search in a binary tree, where decisions to traverse left or right are based on comparisons with the root node's data, aiming to find a target value.

The Following Algorithm Is A(n) ____