Maximum Depth of Binary Tree
🧠 Problem
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.
🏷️ Tags
Tree,Depth-First Search,Breadth-First Search,Binary Tree
📊 Difficulty
Easy
✅ Success Rate: 71.8%
📥 Submissions: 2,259,723
📈 Accepted: 1,621,474
❤️ Reactions
👍 Likes: 6744
👎 Dislikes: 124
💡 Hints
🔁 Similar Questions
- Balanced Binary Tree
- Minimum Depth of Binary Tree
- Maximum Depth of N-ary Tree
- Time Needed to Inform All Employees