Problems ListWidest Binary Tree Level
Medium
Return the width of the widest level in a binary tree, where the width of a level is defined as the distance between its leftmost and rightmost non-null nodes.
Example:
Output: 7
Problems ListProblems ListReturn the width of the widest level in a binary tree, where the width of a level is defined as the distance between its leftmost and rightmost non-null nodes.
Output: 7