Leetcode_binary-tree-level-order-traversal (updated c++ and python version)

地址：http://oj.leetcode.com/problems/binary-tree-level-order-traversal/

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,#,#,15,7},

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

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

confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.

思路：树的层次遍历，用普通队列模拟即可。输出根节点，如果根节点有左右子节点，则入队列。从第一层开始，统计左右子树的个数，用于控制每一层vector个数。

参考代码：

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int> > levelOrder(TreeNode *root) {
        vector<vector<int> >res;
        if(!root)
        {
            return res;
        }
        else
        {
            queue<TreeNode*>q;
            q.push(root);
            while(!q.empty())
            {
                int size = q.size();
                vector<int> vec;
                while(vec.size() < size)
                {
                    TreeNode* root = q.front();
                    q.pop();
                    vec.push_back(root->val);
                    if(root->left)
                    {
                        q.push(root->left);
                    }
                    if(root->right)
                    {
                        q.push(root->right);
                    }
                }
                res.push_back(vec);
            }
        }
        return res;
    }
};

 
 

  
  //SECOND TRAIL
 
 
 
 

  
  class 
  
  Solution 
  
  {
 
 
 
 

  
  public
  
  :
 
 
 
 

  
      
  
  vector
  
  <
  
  vector
  
  <
  
  int
  
  > 
  
  > 
  
  levelOrder
  
  (
  
  TreeNode 
  
  *
  
  root
  
  ) 
  
  {
 
 
 
 

  
          
  
  vector
  
  <
  
  vector
  
  <
  
  int
  
  > 
  
  >
  
  ans
  
  ;
 
 
 
 

  
          
  
  if
  
  (
  
  !
  
  root
  
  )
 
 
 
 

  
              
  
  return 
  
  ans
  
  ;
 
 
 
 

  
          
  
  int 
  
  sz 
  
  = 
  
  0
  
  ;
 
 
 
 

  
          
  
  TreeNode
  
  *
  
  cur 
  
  = 
  
  NULL
  
  ;
 
 
 
 

  
          
  
  queue
  
  <
  
  TreeNode
  
  *>
  
  tq
  
  ;
 
 
 
 

  
          
  
  tq
  
  .
  
  push
  
  (
  
  root
  
  );
 
 
 
 

  
          
  
  while
  
  (
  
  !
  
  tq
  
  .
  
  empty
  
  ())
 
 
 
 

  
          
  
  {
 
 
 
 

  
              
  
  sz 
  
  = 
  
  (
  
  int
  
  )
  
  tq
  
  .
  
  size
  
  ();
 
 
 
 

  
              
  
  vector
  
  <
  
  int
  
  >
  
  vec
  
  ;
 
 
 
 

  
              
  
  while
  
  (
  
  sz
  
  )
 
 
 
 

  
              
  
  {
 
 
 
 

  
                  
  
  --
  
  sz
  
  ;
 
 
 
 

  
                  
  
  cur 
  
  = 
  
  tq
  
  .
  
  front
  
  ();
 
 
 
 

  
                  
  
  tq
  
  .
  
  pop
  
  ();
 
 
 
 

  
                  
  
  vec
  
  .
  
  push_back
  
  (
  
  cur
  
  ->
  
  val
  
  );
 
 
 
 

  
                  
  
  if
  
  (
  
  cur
  
  ->
  
  left
  
  )
 
 
 
 

  
                      
  
  tq
  
  .
  
  push
  
  (
  
  cur
  
  ->
  
  left
  
  );
 
 
 
 

  
                  
  
  if
  
  (
  
  cur
  
  ->
  
  right
  
  )
 
 
 
 

  
                      
  
  tq
  
  .
  
  push
  
  (
  
  cur
  
  ->
  
  right
  
  );
 
 
 
 

  
              
  
  }
 
 
 
 

  
              
  
  ans
  
  .
  
  push_back
  
  (
  
  vec
  
  );
 
 
 
 

  
          
  
  }
 
 
 
 

  
          
  
  return 
  
  ans
  
  ;
 
 
 
 

  
      
  
  }
 
 
 
 

  
  };
 
 

python:

 
 

  
  # Definition for a  binary tree node
 
 
 
 

  
  # class TreeNode:
 
 
 
 

  
  #     def __init__(self, x):
 
 
 
 

  
  #         self.val = x
 
 
 
 

  
  #         self.left = None
 
 
 
 

  
  #         self.right = None
 
 
 
 

  
  

 
 
 
 

  
  class 
  
  Solution
  
  :
 
 
 
 

  
      
  
  # @param root, a tree node
 
 
 
 

  
      
  
  # @return a list of lists of integers
 
 
 
 

  
      
  
  def 
  
  levelOrder
  
  (
  
  self
  
  , 
  
  root
  
  ):
 
 
 
 

  
          
  
  res 
  
  = 
  
  []
 
 
 
 

  
          
  
  if 
  
  not 
  
  root
  
  :
 
 
 
 

  
              
  
  return 
  
  res
 
 
 
 

  
          
  
  q 
  
  = 
  
  [
  
  root
  
  ]
 
 
 
 

  
          
  
  while 
  
  q
  
  :
 
 
 
 

  
              
  
  sz 
  
  = 
  
  len
  
  (
  
  q
  
  )
 
 
 
 

  
              
  
  level 
  
  = 
  
  []
 
 
 
 

  
              
  
  while 
  
  sz
  
  :
 
 
 
 

  
                  
  
  sz 
  
  -= 
  
  1
 
 
 
 

  
                  
  
  cur 
  
  = 
  
  q
  
  .
  
  pop
  
  ()
 
 
 
 

  
                  
  
  level
  
  .
  
  append
  
  (
  
  cur
  
  .
  
  val
  
  )
 
 
 
 

  
                  
  
  if 
  
  cur
  
  .
  
  left
  
  :
 
 
 
 

  
                      
  
  q
  
  .
  
  insert
  
  (
  
  0
  
  , 
  
  cur
  
  .
  
  left
  
  )
 
 
 
 

  
                  
  
  if 
  
  cur
  
  .
  
  right
  
  :
 
 
 
 

  
                      
  
  q
  
  .
  
  insert
  
  (
  
  0
  
  , 
  
  cur
  
  .
  
  right
  
  )
 
 
 
 

  
   
 
 
 
 

  
              
  
  res
  
  .
  
  append
  
  (
  
  level
  
  )
 
 
 
 

  
          
  
  return 
  
  res