Given the root of a binary search tree, rearrange the tree in in order so that the leftmost node becomes the new root of the tree, and every node has no left child and exactly one right child.
Constraints:
The number of nodes in the given tree is in the range
Node.val
Given the root of a binary search tree, rearrange the tree in in order so that the leftmost node becomes the new root of the tree, and every node has no left child and exactly one right child.
Constraints:
The number of nodes in the given tree is in the range
Node.val