largest key in a binary search tree
To find the largest key in a binary search tree, is this correct: start at the root, and recursively visit the node. When the right child is null, the node contains the largest key.
ASKER CERTIFIED SOLUTION
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
ASKER