BST search left

if val < a, then tree (node (a, left, right)) contains val = tree left contains val


Comments

Please log in to add comments