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

Update 0226.翻转二叉树.md JavaScript递归版本

Browse Source
This commit is contained in:
w2xi
2022-07-02 11:14:57 +08:00
parent 23cc66346c
commit 55086c231a
1 changed files with 7 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
problems/0226.翻转二叉树.md
View File

@ -470,25 +470,14 @@ func invertTree(root *TreeNode) *TreeNode {
使用递归版本的前序遍历 使用递归版本的前序遍历
```javascript ```javascript
var invertTree = function(root) { var invertTree = function(root) {
//1. 首先使用递归版本的前序遍历实现二叉树翻转 // 终止条件
//交换节点函数 if (!root) {
const inverNode=function(left,right){ return null;
let temp=left;
left=right;
right=temp;
//需要重新给root赋值一下
root.left=left;
root.right=right;
} }
//确定递归函数的参数和返回值inverTree=function(root) // 交换左右节点
//确定终止条件 const rightNode = root.right;
if(root===null){ root.right = invertTree(root.left);
return root; root.left = invertTree(rightNode);
}
//确定节点处理逻辑 交换
inverNode(root.left,root.right);
invertTree(root.left);
invertTree(root.right);
return root; return root;
}; };
``` ```