Given a binary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
Note: A leaf is a node with no children.
Given binary tree
return its depth = 3.
int left = max(root.left);
int right = max(root.right);
return Math.max(left,right) + 1;
return Math.max(max(root.left) + 1, max(root.right) + 1);
Runtime: 0 ms, faster than 100.00% of Java online submissions for Maximum Depth of Binary Tree.
Memory Usage: 39.2 MB, less than 94.62% of Java online submissions for Maximum Depth of Binary Tree.