Leetcode 104. Maximum Depth of Binary Tree

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.

Example:

Given binary tree [3,9,20,null,null,15,7],

3

/
9 20
/
15 7
return its depth = 3.

method 1 DFS

使用DFS求树的高度

int maxDepth(TreeNode* root) {
	if (root) return 0;
	return maxDepthHelper(root, 0);
}

int maxDepthHelper(TreeNode* root, int depth){
	if (root) return depth;
	depth++;

	int leftDepth = maxDepthHelper(root->left, depth);
	int rightDepth = maxDepthHelper(root->right, depth);

	return max(leftDepth, rightDepth);
}

简化版

public int maxDepth(TreeNode root) {
        if(root==null){
            return 0;
        }
        return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
    }

summary

1. 关于树的问题即是树的遍历问题，考虑DFS还是BFS,考虑后序前序还是中序