File tree Expand file tree Collapse file tree 1 file changed +22
-22
lines changed Expand file tree Collapse file tree 1 file changed +22
-22
lines changed Original file line number Diff line number Diff line change @@ -19,15 +19,15 @@ Big O
19
19
* }
20
20
*/
21
21
func invertTree (root * TreeNode ) * TreeNode {
22
- if root == nil {
23
- return root
24
- }
22
+ if root == nil {
23
+ return root
24
+ }
25
25
26
- tmp := invertTree (root .Right )
27
- root .Right = invertTree (root .Left )
28
- root .Left = tmp
26
+ tmp := invertTree (root .Right )
27
+ root .Right = invertTree (root .Left )
28
+ root .Left = tmp
29
29
30
- return root
30
+ return root
31
31
}
32
32
33
33
/*
@@ -54,24 +54,24 @@ Big O
54
54
* Right *TreeNode
55
55
* }
56
56
*/
57
- func invertTree (root * TreeNode ) * TreeNode {
58
- queue := make ([]* TreeNode , 0 )
59
- queue = append (queue , root )
57
+ func invertTree (root * TreeNode ) * TreeNode {
58
+ queue := make ([]* TreeNode , 0 )
59
+ queue = append (queue , root )
60
60
61
- for len (queue ) > 0 {
62
- node := queue [0 ]
63
- queue = queue [1 :]
61
+ for len (queue ) > 0 {
62
+ node := queue [0 ]
63
+ queue = queue [1 :]
64
64
65
- if node == nil {
66
- continue
67
- }
65
+ if node == nil {
66
+ continue
67
+ }
68
68
69
- tmp := node .Left
70
- node .Left = node .Right
71
- node .Right = tmp
69
+ tmp := node .Left
70
+ node .Left = node .Right
71
+ node .Right = tmp
72
72
73
- queue = append (queue , node .Left , node .Right )
74
- }
73
+ queue = append (queue , node .Left , node .Right )
74
+ }
75
75
76
- return root
76
+ return root
77
77
}
You can’t perform that action at this time.
0 commit comments