We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 8676683 commit b03ce22Copy full SHA for b03ce22
99. 把二叉搜索树转换为累加树.md
@@ -19,6 +19,6 @@ class Solution:
19
node.val = self.total
20
dfs(node.left)
21
22
- recur(root)
+ dfs(root)
23
return root
24
```
0 commit comments