You are given the root node of a binary search tree (BST) and a val to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.
Notice that there may exist multiple valid ways for the insertion, as long as the tree remains a BST after insertion. You can return any of them.
0 <= Number of nodes <= 10^4-10^8 <= Node.val <= 10^8Node.val are unique-10^8 <= val <= 10^8val does not exist in the original BSTroot = [4,2,7,1,3], val = 5[4,2,7,1,3,5]root = [40,20,60,10,30,50,70], val = 25[40,20,60,10,30,50,70,null,null,25]root = [], val = 5[5]