✨ [104] recursive way

Author: enkr1

104/my_solution.js

@@ -11,20 +11,25 @@
  * @return {number}
  */
 const maxDepth = (root) => {
-  let depth = 0;
-
-  const dfs = (currNode, tmpDepth) => {
-    if (null !== currNode) {
-      tmpDepth++;
-      dfs(currNode.left, tmpDepth);
-      dfs(currNode.right, tmpDepth);
-    } else {
-      depth = Math.max(depth, tmpDepth);
-      return;
-    }
-  }
-
-  dfs(root, 0);
-
-  return depth;
+  if (null === root) return 0;
+  return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
 };
+
+// const maxDepth = (root) => {
+//   let depth = 0;
+//
+//   const dfs = (currNode, tmpDepth) => {
+//     if (null !== currNode) {
+//       tmpDepth++;
+//       dfs(currNode.left, tmpDepth);
+//       dfs(currNode.right, tmpDepth);
+//     } else {
+//       depth = Math.max(depth, tmpDepth);
+//       return;
+//     }
+//   }
+//
+//   dfs(root, 0);
+//
+//   return depth;
+// };