이진 트리의 중위 순위 / 기초

Author: JooKangsan

JooKangSan/[week5]Tree/Binary_Tree_Inorder_Traversal.js

@@ -0,0 +1,14 @@
+function inorderTraversal(root) {
+    const result = [];
+    
+    function inorder(node) {
+        if (!node) return;
+        
+        inorder(node.left);
+        result.push(node.val);
+        inorder(node.right);
+    }
+    
+    inorder(root);
+    return result;
+}

JooKangSan/[week5]Tree/Maximum_Depth_of_Binary_Tree.js

@@ -0,0 +1,17 @@
+/**
+ * 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 maxDepth(root) {
+    if (!root) return 0;
+    
+    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
+}