Binary Tree Level Order Traversal

题目来源：Leetcode Algorithm ProblemSet 102

题目描述：

Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).

For example:
Given binary tree [3,9,20,null,null,15,7],

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

解题思路：使用bfs深度优先搜索进行遍历

题解代码：

[cpp]  view plain  copy

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.   
11. struct DTreeNode {  
12.     TreeNode *node;  
13.     int dep;  
14.     DTreeNode(int d, TreeNode *r): dep(d), node(r) {}  
15. };  
16.   
17. class Solution {  
18. public:  
19.     vector<vector<int> > levelOrder(TreeNode* root) {  
20.         vector < vector<int> > ret;  
21.           
22.         if (root == NULL) return ret;  
23.           
24.         vector < int > dep0;  
25.         queue < DTreeNode* > q;  
26.         q.push( new DTreeNode(0, root) );  
27.          
28.           
29.         while (! q.empty()) {  
30.             DTreeNode * tp = q.front();  
31.             q.pop();  
32.             int dep = tp->dep;  
33.               
34.             if (dep >= ret.size()) {  
35.                 ret.push_back( vector<int>{} );  
36.             }  
37.               
38.             ret[dep].push_back( tp->node->val );  
39.               
40.             if (tp->node->left) {  
41.                 q.push( new DTreeNode(dep+1, tp->node->left) );  
42.             }  
43.               
44.             if (tp->node->right) {  
45.                 q.push( new DTreeNode(dep+1, tp->node->right) );  
46.             }  
47.         }  
48.           
49.         return ret;  
50.     }  
51. };