Leetcode 701. Insert into a Binary Search Tree

Given a BST root and a value not already present, insert the value as a new leaf in the correct position to preserve BST ordering and return the root. This is done by traversing from the root to the appropriate null child (O(h) time).