Maximum Depth of Binary Tree at Arista Networks
Easy77.9% acceptance
This problem has 75.0% frequency at Arista Networks.
Problem Description
Given the `root` of a binary tree, return _its maximum depth_. A binary tree's **maximum depth** is the number of nodes along the longest path from the root node down to the farthest leaf node.
Read full problem and hintsTopics
Also asked at 15 companies
More Arista Networks Questions
Course Schedule IIMediumBinary Tree Maximum Path SumHardKth Largest Element in a StreamEasyPath Sum IIMediumWord SearchMedium
View all Arista Networks questions