Tree Flashcards

1
Q
  1. Maximum Depth of Binary Tree
A
public int maxDepth(TreeNode root) {
        if (root == null) {
            return 0;
        }
        return 1 + Math.max(maxDepth(root.left), maxDepth(root.right));
    }
How well did you know this?
1
Not at all
2
3
4
5
Perfectly