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
1919 * }
2020 */
2121 func invertTree (root * TreeNode ) * TreeNode {
22- if root == nil {
23- return root
24- }
22+ if root == nil {
23+ return root
24+ }
2525
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
2929
30- return root
30+ return root
3131}
3232
3333/*
@@ -54,24 +54,24 @@ Big O
5454 * Right *TreeNode
5555 * }
5656 */
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 )
6060
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 :]
6464
65- if node == nil {
66- continue
67- }
65+ if node == nil {
66+ continue
67+ }
6868
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
7272
73- queue = append (queue , node .Left , node .Right )
74- }
73+ queue = append (queue , node .Left , node .Right )
74+ }
7575
76- return root
76+ return root
7777}
You can’t perform that action at this time.
0 commit comments