Diameter of Binary Tree

Longest path between any two nodes

Read Here
Step0/35
Best Diameter0
Updates0
Back To Trees List

Python Code

10 
●    def diameterOfBinaryTree(self, root):
12        def heights(node):
13            if node is None:
14                return 0
15            L = heights(node.left)
16            R = heights(node.right)
Current Line (11): Function Entry

Tree Structure

1234567
ENTER:

Diameter Progress

Current Node

-

Phase

Enter Function

Best Diameter

0

Diameter Timeline

Diameter updates appear here...
Step 1: ENTER:

Recursion Stack

Stack is empty. Click Next to begin!

Step Explanation

Ready to Start

Click Next Step to begin diameter computation with DFS heights.

  • > Each node computes left height and right height.
  • > Global best updates using leftHeight + rightHeight.