Problem:
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.
Summary:
求二叉树的深度。
1 /** 2 * Definition for a binary tree node. 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */ 10 class Solution { 11 public: 12 int maxDepth(TreeNode* root) { 13 if (root == NULL) return 0; 14 15 int leftDep = maxDepth (root->left); 16 int rightDep = maxDepth (root->right); 17 18 return leftDep > rightDep ? leftDep + 1 : rightDep + 1; 19 } 20 };
转载于:https://www.cnblogs.com/VickyWang/p/5988910.html
