Example 1

The number of nodes in the tree will be in the range [1, 1000].0 <= Node.val <= 5000root is a complete binary tree.0 <= val <= 5000At most 104 calls will be made to insert and get_root.Example 1

The number of nodes in the tree will be in the range [1, 1000].0 <= Node.val <= 5000root is a complete binary tree.0 <= val <= 5000At most 104 calls will be made to insert and get_root.