LC #102

Author: aditya43

26-LeetCode/07-Binary-Tree-Level-Order-Traversal-LC-102.js

@@ -19,3 +19,53 @@ return its level order traversal as:
   [15,7]
 ]
 */
+
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+/**
+ * @param {TreeNode} root
+ * @return {number[][]}
+ */
+var levelOrder = function (root) {
+    var result = [];
+
+    if (root === null) {
+        return result;
+    }
+
+    var queue = [];
+    var temp = [];
+    var curLvlCnt = 1;
+    var nextLvlCnt = 0;
+
+    queue.push(root);
+
+    while (queue.length !== 0) {
+        var p = queue.shift();
+        temp.push(p.val);
+        curLvlCnt--;
+
+        if (p.left) {
+            queue.push(p.left);
+            nextLvlCnt++;
+        }
+        if (p.right) {
+            queue.push(p.right);
+            nextLvlCnt++;
+        }
+
+        if (curLvlCnt === 0) {
+            result.push(temp);
+            curLvlCnt = nextLvlCnt;
+            nextLvlCnt = 0;
+            temp = [];
+        }
+    }
+
+    return result;
+};