Write code for a method split(int key, Node root) that divides a binary search tree into two parts. The split should occur at key and create two new binary search trees. Return the root of each resulting tree