#897
Increasing Order Search Tree
newbie · 200 · lc easy +16 · verified · 78.9% accepted · 4,477 likes · top 90%
Description
Given the root of a binary search tree, relink all nodes in in-order (ascending) so the minimum value becomes the new root. Every node in the result must have no left child and at most one right child, forming a right-skewed chain.
Example 1:
Input: root = [5,3,6,2,4,null,8,1,null,null,null,7,9]
Output: [1,null,2,null,3,null,4,null,5,null,6,null,7,null,8,null,9]
Example 2:
Input: root = [5,1,7]
Output: [1,null,5,null,7]
Code
1
2
3
4
5
6
7
8
9