Search results
Maximum Depth of Binary Tree - 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.
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. Example 1 : Input: root = [3,9,20,null,null,15,7] Output: 3. Example 2 : Input: root = [1,null,2] Output: 2. Constraints. The number of nodes in the tree is in the range [0, 104]. -100 <= Node.val <= 100.
Maximum Depth of Binary Tree. Time: O (n) O(n) Space: O (1) O(1) C++ Java Python. 1 2 3 4 5 6 7 8. class Solution { public: int maxDepth(TreeNode* root) { if (root == nullptr) return 0; return 1 + max(maxDepth(root->left), maxDepth(root->right)); } }; LeetCode Solutions in C++20, Java, Python, MySQL, and TypeScript.
Problem Description. In this LeetCode problem, we are given a binary tree, which is a tree data structure where each node has at most two children, referred to as the left child and the right child. The task is to find the maximum depth of the tree.
Mar 28, 2024 · 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. Example 1: Input: root = [3,9,20,null,null,15,7] Output: 3. Example 2: Input: root = [1,null,2] Output: 2.
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. Constraints: The number of nodes in the tree is in the range \([0, 10^4]\).-100 <= Node.val <= 100
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. Example 1: Input: root = [3,9,20,null,null,15,7]
