How would you go about splitting a Binary Search Tree. The function call looks like this, "void split(Node *T, int k, Node **L, Node **R)" where k is the key where it needs to be split. Everything on the left should be <= k. I am stuck on this function. Please help.