algo_057
Problem Statement
Problem Statement
Write a recursive algorithm to search an element in a Binary Search Tree (BST).
Algorithm
procedure search(T, key)
begin
if (T = NULL or INFO(T) = key) then
return T;
else if (key < INFO(T)) then
return search(LC(T), key);
else
return search(RC(T), key);
endif
end procedure1
2
3
4
5
6
7
8
9
10
2
3
4
5
6
7
8
9
10