【LeetCode】Maximum Depth of Binary Tree (二叉樹最大深度)

題目描述：

思路：採用遞迴的思想，父結點的深度 = max{左右兒子深度} +1

/** * Definition for binary tree * struct TreeNode { *     int val; *     TreeNode *left; *     TreeNode *right; *     TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public:    int maxDepth(TreeNode *root) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        return func(root);    }    int func(TreeNode *root)    {        if(root == NULL) return 0;        int leftdepth = func(root->left);        int rightdepth =func(root->right);        leftdepth = leftdepth>rightdepth? leftdepth+1:rightdepth+1;        return leftdepth;    }};