3
/ \
9 20
/ \
15 7
给出一棵二叉树,返回其节点值的层次遍历(逐层从左往右访问)
输出
[
[3],
[9,20],
[15,7]
]
思路,运用Queue(队列) 先进先出的特点存储二叉树每层节点
public List<List<int>> LevelOrder2(TreeNode root)
{
List<List<int>> res = new List<List<int>>();
if (root == null) return res;
Queue<TreeNode> treeNodes = new Queue<TreeNode>();
treeNodes.Enqueue(root);
while (treeNodes.Count > 0)
{
List<int> temp = new List<int>();
int n = treeNodes.Count;
for (int i = 0; i < n; i++)
{
TreeNode node = treeNodes.Dequeue();
temp.Add(node.val);
if (node.left != null) treeNodes.Enqueue(node.left);
if (node.right != null) treeNodes.Enqueue(node.right);
}
res.Add(temp);
}
return res;
}
LineCode上面没法用C# 就用Java写,虽然Java与C#语法基本一致但是还是有很多方法名,细节不一样的下面是Java代码
public List<List<Integer>> levelOrder(TreeNode root) {
// write your code here
List<List<Integer>> res=new ArrayList<List<Integer>>();
if(root==null) return res;
Queue<TreeNode> queue=new LinkedList<TreeNode>();
queue.offer(root);
while(!queue.isEmpty()){
List<Integer> temp=new ArrayList<Integer>();
int n=queue.size();
for(int i=0;i<n;i++){
TreeNode node=queue.poll();
temp.add(node.val);
if(node.left!=null)
queue.offer(node.left);
if(node.right!=null)
queue.offer(node.right);
}
res.add(temp);
}
return res;
}
最后是自己最初写的解法
public List<List<int>> LevelOrder(TreeNode head)
{
List<List<int>> res = new List<List<int>>();
List<TreeNode> treeList = new List<TreeNode>();
List<TreeNode> treeList2 = new List<TreeNode>();
bool b = true;
treeList.Add(head);
while (true)
{
List<int> temp = new List<int>();
if (b)
{
foreach (TreeNode node in treeList)
{
temp.Add(node.val);
if (node.left != null) treeList2.Add(node.left);
if (node.right != null) treeList2.Add(node.right);
}
treeList.Clear();
b = false;
res.Add(temp);
if (treeList2.Count == 0)
break;
}
else
{
foreach (TreeNode node in treeList2)
{
temp.Add(node.val);
if (node.left != null) treeList.Add(node.left);
if (node.right != null) treeList.Add(node.right);
}
treeList2.Clear();
b = true;
res.Add(temp);
if (treeList.Count == 0)
break;
}
}
return res;
}
,用了两个List数组,感觉自己好笨:),数据结构还是很薄弱,以后加强练习!!!