|
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.
求二叉樹的最大深度問題用到深度優(yōu)先搜索DFS，遞歸的完美應(yīng)用，跟求二叉樹的最小深度問題原理相同。代碼如下：
 class Solution { public: int maxDepth(TreeNode* root) { if (!root) return 0; return 1 + max(maxDepth(root->left), maxDepth(root->right)); } };
求二叉樹的最小深度可以參見我的博文： http://www.cnblogs.com/grandyang/p/4042168.html
分類: LeetCode |
|
|
