Time: 2 ms (8.93%), Space: 5.5 MB (83.53%) - LeetHub

hovanhoa · Jan 13, 2025 · 632d61b · 632d61b
1 parent c187d88
commit 632d61b
Showing 1 changed file with 7 additions and 9 deletions.
diff --git a/0102-binary-tree-level-order-traversal/0102-binary-tree-level-order-traversal.go b/0102-binary-tree-level-order-traversal/0102-binary-tree-level-order-traversal.go
@@ -11,6 +11,7 @@ func levelOrder(root *TreeNode) [][]int {
         return [][]int{}
     }
 
+
     ans := [][]int{}
     queue := []*TreeNode{root}
 
@@ -22,16 +23,13 @@ func levelOrder(root *TreeNode) [][]int {
             node := queue[0]
             queue = queue[1:]
 
-            if node != nil {
-                level = append(level, node.Val)
-
-                if node.Left != nil {
-                    queue = append(queue, node.Left)
-                }
+            level = append(level, node.Val)
+            if node.Left != nil {
+                queue = append(queue, node.Left)
+            }
 
-                if node.Right != nil {
-                    queue = append(queue, node.Right)
-                }
+            if node.Right != nil {
+                queue = append(queue, node.Right)
             }
         }