776. Split BST

MediumTree Preparing judge… LeetCode

TreeBinary Search TreeRecursionBinary Tree

Hint 1

Use recursion. If root.val <= V, you split root.right into two halves, then join it's left half back on root.right.

Preparing judge…

Input