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.

二、代码实现

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