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.

分析：
求二叉树最长路径，用递归没得说。

代码:

/*

struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
};

*/

int maxDepth(struct TreeNode* root) {
if(root==NULL)return 0;
else{
int leftNum=maxDepth(root->left)+1;
int rightNum=maxDepth(root->right)+1;
return leftNum>rightNum?leftNum:rightNum;
}
}