• Home
• com.github.javadev
• leetcode-in-all
• 1.6
• source code
• solution.ts

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0501_0600.s0543_diameter_of_binary_tree.solution.ts Maven / Gradle / Ivy

// #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
// #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
// #2023_09_30_Time_61_ms_(80.89%)_Space_47.4_MB_(18.15%)

function diameterOfBinaryTree(root: TreeNode | null): number {
    let ans = 0
    function dfs(node: TreeNode | null): number {
        if (node === null) {
            return 0
        }
        let left = dfs(node.left)
        let right = dfs(node.right)
        ans = Math.max(ans, left + right)

        return Math.max(left, right) + 1
    }
    dfs(root)
    return ans
}

export { diameterOfBinaryTree }