This method finds the smallest data value in a binary tree node. It starts at the given node, then traverses left to find the leftmost node, keeping track of the smallest data along the way. When finished traversing left, it returns the smallest data found.
This method finds the smallest data value in a binary tree node. It starts at the given node, then traverses left to find the leftmost node, keeping track of the smallest data along the way. When finished traversing left, it returns the smallest data found.
This method finds the smallest data value in a binary tree node. It starts at the given node, then traverses left to find the leftmost node, keeping track of the smallest data along the way. When finished traversing left, it returns the smallest data found.