[LeetCode] (Trees) Lv Easy. Maximum Depth of Binary Tree

https://leetcode.com/explore/interview/card/top-interview-questions-easy/94/trees/555/

Explore - LeetCode

 

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

GitHub : https://github.com/developeSHG/Algorithm-LeetCode/tree/main/maximum-depth-of-binary-tree

GitHub - developeSHG/Algorithm-LeetCode: 릿코드 소스코드