Happy thanksgiving everyone,
I'm trying to get a general idea of how to split a single binary search tree into two seperate tree. I was curious is there a general form or procedure to do this? Thank you for your time.
Procedure: P* is a pointer to BST, nd x is the value that may or may not be in the BST. I need to split P into two BST q and r so that q contails all the vaues in p that are less than x, and r contains all the values in p that are great than x.