How do i find the minimum value in a binary tree (non ordered) recursively?
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.
My homepage
Advice: Take only as directed - If symptoms persist, please see your debugger
Linus Torvalds: "But it clearly is the only right way. The fact that everybody else does it some other way only means that they are wrong"
Great. Thanks! Code works perfectly.