leetcode104.MaximumDepthofBinaryTree（C语言数据结构，二叉树的深度，递归）30

贴原题&＃xff1a;

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.

解析&＃xff1a;
　　本题是要求二叉树的深度。这应该算是数据结构最基础的题目了。

&＃xff23;代码&＃xff1a;

/*** Definition for a binary tree node.* struct TreeNode {* int val;* struct TreeNode *left;* struct TreeNode *right;* };*/
int maxDepth(struct TreeNode* root) {int l_depth&＃61;0, r_depth&＃61;0;if(root!&＃61;NULL)//根节点非空则继续向下遍历{l_depth&＃61;maxDepth(root->left)&＃43;1;//深度&＃43;&＃xff11;r_depth&＃61;maxDepth(root->right)&＃43;1;}return l_depth>r_depth?l_depth:r_depth;//取左右最大值
}