/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
int Depth = 0;
if(root == NULL) return 0;
queue<TreeNode*> layer;
layer.push(root);
while( !layer.empty() )
{
Depth++;
//利用queue遍历一层的节点
for(int i = 0, n = layer.size(); i < n; i++)
{
TreeNode *tmp = layer.front();
//cout<<tmp->val;
layer.pop();
if( tmp->left != NULL)
layer.push(tmp->left);
if( tmp->right != NULL)
layer.push(tmp->right);
}
}
return Depth;
}
};