Leetcode Problem 543. Diameter of Binary Tree

543. Diameter of Binary Tree

Leetcode Solutions

Initialize a global variable diameter to 0 to keep track of the maximum diameter.
Define a recursive function longestPath that computes the height of the subtree rooted at the given node and updates the diameter.
If the current node is None, return 0.
Recursively find the longest path in the left subtree and the right subtree.
Update the diameter with the sum of the longest paths from the left and right if it's greater than the current diameter.
Return the height of the current subtree, which is 1 plus the maximum of the longest paths from the left and right subtrees.
Call longestPath with the root of the tree.
After the recursion completes, return the value of diameter.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen