We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f36d2a1 commit 808f2f3Copy full SHA for 808f2f3
problems/算法模板.md
@@ -75,7 +75,7 @@ void traversal(TreeNode* cur, vector<int>& vec) {
75
traversal(cur->right, vec); // 右
76
}
77
```
78
-中序遍历(中左右)
+前序遍历(中左右)
79
80
void traversal(TreeNode* cur, vector<int>& vec) {
81
if (cur == NULL) return;
0 commit comments