使用BFS 与 DFS 两种方法进行计算:
DFS:
迭代思想,一直走到底,寻找能走的最长路线。
/**
* 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) {
return !root ? 0 : max(maxDepth(root -> left),maxDepth(root -> right))+1;
}
};
~~~c
/**
* 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) {
if(!root)
{
return 0;
}
int n = 0;
queue<TreeNode*> q;
q.push(root);
while (!q.empty())
{
int size = q.size();
for (int i = 0; i <size; i++)
{
TreeNode * tr = q.front();
q.pop();
if(tr -> left) q.push(tr -> left);
if(tr -> right) q.push(tr -> right);
}
n++;
}
return n;
}
};
如何做到层次遍历呢?关键点在于每次传入的这一部分:
size为这一层的全部节点,传入后在下次循环中全部pop出很棒