Given a Binary Search Tree, and an integer k, cut the BST vertically into two substrees A and B, where all nodes in A <= k and all nodes in B > k.
Contrain: for any node A and it’s parent B in the original BST. If after the cut they are both in the same subtree. B should still be the parent of A.
/ \ / \
10 30 55 70
k = 50
Copyright © A++ Code Bootcamp 2023