[leet] bst

Author: hyeonbinHur

허현빈/11주차/Construct Binary Tree from Preorder and Inorder Traversal-2.js

@@ -0,0 +1,29 @@
+/**
+ * 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 {TreeNode}
+ */
+var invertTree = function (node) {
+  const swapValue = (node) => {
+    const temp = node.left;
+    node.left = node.right;
+    node.right = temp;
+  };
+  const travTree = (node) => {
+    if (!node) {
+      return;
+    }
+    swapValue(node);
+    travTree(node.left);
+    travTree(node.right);
+  };
+  travTree(node);
+  return node;
+};

허현빈/11주차/Invert Binary Tree.js

@@ -0,0 +1,25 @@
+/**
+ * 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}
+ */
+var maxDepth = function (root) {
+  let depth = 0;
+  const findDepth = (node, depth) => {
+    if (!node || node.val === null) {
+      return depth;
+    }
+    return Math.max(
+      findDepth(node.right, depth + 1),
+      findDepth(node.left, depth + 1)
+    );
+  };
+  return findDepth(root, depth);
+};

허현빈/11주차/Maximum Depth of Binary Tree.js

@@ -0,0 +1,29 @@
+/**
+ * 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} p
+ * @param {TreeNode} q
+ * @return {boolean}
+ */
+
+var isSameTree = function (p, q) {
+  const isSame = (node1, node2) => {
+    if (!node1 && !node2) {
+      return true;
+    }
+    if (!node1 || !node2) {
+      return false;
+    }
+    if (node1.val !== node2.val) {
+      return false;
+    }
+    return isSame(node1.left, node2.left) && isSame(node1.right, node2.right);
+  };
+  return isSame(p, q);
+};