Leetcode-104.二叉树的最大深度

题目背景

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
Example 3:

Input: root = [] Output: 0
Example 4:

Input: root = [0] Output: 1

Constraints:

The number of nodes in the tree is in the range [0, 104].
-100 <= Node.val <= 100

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/maximum-depth-of-binary-tree
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

解法一（深度优先算法）

if(root==NULL)
	return 0;
return max(maxDepth(root->left),maxDepth(root->right))+1;

解法二（广度优先算法）

if(root==nullptr)
	return 0;
queue<TreeNode*> Q;
Q.push(root);
int ans = 0;
while(!Q.empty()){
	in sz = Q.size();
	while(sz>0){
		TreeNode* node = Q.front();
		Q.pop();
		if(node->left)
			Q.push(node->left);
		if(node->right)
			Q.push(node->right);
		sz-=1;
	}
	ans+=1;
} 
return ans;