897. Increasing Order Search Tree
Easy
Given the root
of a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now the root of the tree, and every node has no left child and only one right child.
Example 1:
Example 2:
Constraints:
The number of nodes in the given tree will be in the range
[1, 100]
.0 <= Node.val <= 1000
解題
Last updated