In a Binary Search Tree (BST), the minimum value is found by traversing left as far as possible, while the maximum value is found by traversing right as far as possible.
Click on "Find Minimum" to see how we find the smallest value in the tree.
Click on "Find Maximum" to see how we find the largest value in the tree.