How do i find the minimum value in a binary tree (non ordered) recursively?
Printable View
How do i find the minimum value in a binary tree (non ordered) recursively?
pseudocode:
if this node is NULL, return not found
if this node is small than my currently remembered value, remember it
call self for the left node
call self for the right node.
Great. Thanks! Code works perfectly.