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]
]
层序遍历一颗二叉树,借助一个队列就可以了
为了偷懒简写,注意我定义了几个#define 字符替换
代码比较易懂,我就不解释了。
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNod......
阅读全文