algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

添加（二叉树的递归遍历.md）：删除多余的js版本

Browse Source
This commit is contained in:
Steve2020
2022-01-24 20:27:15 +08:00
parent a488a3414a
commit fec8e0882a
1 changed files with 0 additions and 34 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
problems/二叉树的递归遍历.md
View File

@ -270,40 +270,6 @@ func postorderTraversal(root *TreeNode) (res []int) {
} }
``` ```
javaScript:
```js
前序遍历:
var preorderTraversal = function(root, res = []) {
if (!root) return res;
res.push(root.val);
preorderTraversal(root.left, res)
preorderTraversal(root.right, res)
return res;
};
中序遍历:
var inorderTraversal = function(root, res = []) {
if (!root) return res;
inorderTraversal(root.left, res);
res.push(root.val);
inorderTraversal(root.right, res);
return res;
};
后序遍历:
var postorderTraversal = function(root, res = []) {
if (!root) return res;
postorderTraversal(root.left, res);
postorderTraversal(root.right, res);
res.push(root.val);
return res;
};
```
Javascript版本： Javascript版本：
前序遍历： 前序遍历：