leetcode-Maximum Depth of Binary Tree(2014.1.21)

递归方法：

/**

 * 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) {

        if(root == NULL) 

            return 0;

        return max(maxDepth(root->left),maxDepth(root->right))+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) {

        if(root == NULL) 

            return 0;

        int leftDepth=maxDepth(root->left);

        int rightDepth=maxDepth(root->right);

        return max(leftDepth,rightDepth)+1;

    }

   

};