Maximum Depth of Binary Tree

Description:

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.

Code:

    int maxDepth(TreeNode* root) {

        //先用递归算法求解

        if ( root == NULL )

            return 0;

        else

            return 1+max(maxDepth(root->left), maxDepth(root->right));

    }