forked from zhanfang/JavaScript-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathinvert-binary-tree.js
More file actions
65 lines (52 loc) · 1.15 KB
/
invert-binary-tree.js
File metadata and controls
65 lines (52 loc) · 1.15 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
//反转二叉树
/**
* Question:
* Invert a binary tree.
4
/ \
2 7
/ \ / \
1 3 6 9
* to
4
/ \
7 2
/ \ / \
9 6 3 1
*
* /
/**
* Definition for a binary tree node.
* function TreeNode(val) {
* this.val = val;
* this.left = this.right = null;
* }
*/
/**
* @param {TreeNode} root
* @return {TreeNode}
*/
var invertTree = function(root) {
if (root){
// 遍历节点做交换位置
root.left = [invertTree(root.right), root.right = invertTree(root.left)][0];
}
return root;
};
// 不递归版本
var invertTree = function(root) {
if (root !== null) {
var nodes = [root];
while(nodes.length) {
//将数组中第一个值抛出来，node做对象引用
var node = nodes.shift();
if(node === null) continue;
//放进数组中继续遍历子节点，全部做左右交换
nodes.push(node.left);
nodes.push(node.right);
//交换左右树
node.right = [node.left, node.left = node.right][0];
}
}
return root;
};