Diameter of Binary Tree | Dataford Interview Questions

Diameter of Binary Tree (LeetCode 543).

Asked in the round 2 stage. Given a binary tree, return the number of edges on the longest path between any two nodes. Represent the tree as nested dictionaries with val, left, and right keys, using null for an absent child.

Function

def diameter_of_binary_tree(root): returns an integer.

Constraints

0 <= number of nodes <= 1000
Node values are integers
The diameter is measured in edges
Each node has at most one left child and one right child

Function Signature

def diameter_of_binary_tree(root):

Your question is Diameter of Binary Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem