##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Add a new value
Given the root of a BST and a value to insert, insert the value into the BST and return the root. It is guaranteed that the new value does not exist in the original BST.
You may return any valid BST after insertion. There can be multiple valid results. Example: Inserting 5 into could produce . Constraints: up to nodes, values from to .
