99. Recover Binary Search Tree
Two elements of a binary search tree (BST) are swapped by mistake.
Recover the tree without changing its structure.
Example 1:
Input: [1,3,null,null,2]
1
/
3
\
2
Output: [3,1,null,nul...
原创
2019-03-26 14:33:03 ·
94 阅读 ·
0 评论
关注
分享
扫一扫