Develop a recursive algorithm in psuedocode to find the smal

Develop a recursive algorithm in psuedocode to \"find the smallest node in a binary search tree\"

Solution

algorithm findsmallestBST(root)

pre root is a pointer to a non empty BST or sub tree

if(left subtree is empty)

return(root)

end if

return findsmallestBST(left subtree)

end findsmallesBST