From 632d61b3b6a1f39240e1307f1f1393d4f7c20310 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?H=E1=BB=93=20V=C4=83n=20H=C3=B2a?=
 <56647826+hovanhoa@users.noreply.github.com>
Date: Mon, 13 Jan 2025 10:32:34 +0700
Subject: [PATCH] Time: 2 ms (8.93%), Space: 5.5 MB (83.53%) - LeetHub

---
 .../0102-binary-tree-level-order-traversal.go    | 16 +++++++---------
 1 file changed, 7 insertions(+), 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
index fce21f9..53e8b39 100644
--- 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)
             }
         }