mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 08:50:15 +08:00
修改 0108.将有序数组转换为二叉搜索树.md 注释
This commit is contained in:
@ -375,7 +375,7 @@ var sortedArrayToBST = function (nums) {
|
||||
};
|
||||
```
|
||||
|
||||
##C
|
||||
## C
|
||||
递归
|
||||
```c
|
||||
struct TreeNode* traversal(int* nums, int left, int right) {
|
||||
|
Reference in New Issue
Block a user