[JustDevRae] 25.02.07 (#39)

* remove smallest number / 중급

* divisible numbers array / 중급

* duplicate number count / 기초

* matrix addition / 중급

* array element length / 기초

* rotate array / 기초

* slice array / 기초

* array algorithm md file

* reverse string / 기초

* control Z / 기초

* dart game / 중급

* valid parentheses / 중급

* crane claw game / 중급

* pair count / 기초

* find point position / 기초

* login success / 기초

* card bundle / 중급

* make hamburger / 중급

* process / 심화

* morse code / 기초

* make B with A / 기초

* setting order care / 기초

* not finish runner / 중급

* rank order / 기초

* sameTree / 기초

* invert binary tree / 기초

* maximum depth of binary / 기초

* binary tree inorder traversal / 기초

* binary tree level order traversal / 중급

Author: JustDevRae

JustDevRae/Tree/binary_tree_inorder_traversal.js

@@ -0,0 +1,18 @@
+function inorderTraversal(root) {
+  let result = [];
+  let stack = [];
+  let current = root;
+
+  while (current || stack.length) {
+    while (current) {
+      stack.push(current); 
+      current = current.left; 
+    }
+
+    current = stack.pop(); 
+    result.push(current.val); 
+    current = current.right;
+  }
+
+  return result;
+}

JustDevRae/Tree/binary_tree_level_order_traversal.js

@@ -0,0 +1,23 @@
+function levelOrder(root) {
+  if (!root) return [];
+
+  let result = [];
+  let queue = [root];
+
+  while (queue.length > 0) {
+    let level = [];
+    let size = queue.length;
+
+    for (let i = 0; i < size; i++) {
+      let node = queue.shift();
+      level.push(node.val);
+
+      if (node.left) queue.push(node.left);
+      if (node.right) queue.push(node.right);
+    }
+
+    result.push(level);
+  }
+
+  return result;
+}

JustDevRae/Tree/invert_binary_tree.js

@@ -0,0 +1,10 @@
+function invertTree(root) {
+  if (!root) return null;
+
+  [root.left, root.right] = [root.right, root.left];
+
+  invertTree(root.left);
+  invertTree(root.right);
+
+  return root;
+}

JustDevRae/Tree/maximum_depth_of_binary.js

@@ -0,0 +1,5 @@
+function maxDepth(root) {
+  if (!root) return 0;
+
+  return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
+}

JustDevRae/Tree/same_tree.js

@@ -0,0 +1,10 @@
+function isSameTree(p, q) {
+  
+  if (!p && !q) return true;
+  
+  if (!p || !q) return false;
+  
+  if (p.val !== q.val) return false;
+
+  return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
+}