How do you split a BST where the value X may or may not be in the tree into BST q,r , given that all the values in tree Q is less than or equal to X and tree r is greater than or equal to X ?
How do you split a BST where the value X may or may not be in the tree into BST q,r , given that all the values in tree Q is less than or equal to X and tree r is greater than or equal to X ?