mirror of
https://github.com/halfrost/LeetCode-Go.git
synced 2025-07-05 16:36:41 +08:00
添加内容
This commit is contained in:
@ -1,7 +1,7 @@
|
||||
# [897. Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)
|
||||
|
||||
|
||||
## 题目:
|
||||
## 题目
|
||||
|
||||
Given 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 1 right child.
|
||||
|
||||
|
Reference in New Issue
Block a user