이진 트리 레벨 순서 순회

Author: JooKangsan

JooKangSan/[week5]Tree/Binary_Tree_Level_Order_Traversal.js

@@ -0,0 +1,36 @@
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val, left, right) {
+ *     this.val = (val===undefined ? 0 : val)
+ *     this.left = (left===undefined ? null : left)
+ *     this.right = (right===undefined ? null : right)
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[][]}
+ */
+function levelOrder(root){
+    if (!root) return [];
+  
+    const result = [];
+    const queue = [root];
+  
+    while (queue.length > 0) {
+      const levelSize = queue.length;
+      const levelNodes = [];
+  
+      for (let i = 0; i < levelSize; i++) {
+        const node = queue.shift();
+        levelNodes.push(node.val);
+  
+        if (node.left) queue.push(node.left);
+        if (node.right) queue.push(node.right);
+      }
+  
+      result.push(levelNodes); 
+    }
+  
+    return result;
+  };
+