FWNX-creates a linked list of all the nodes at each depth-JAVA VERSION

kingoverlord

于 2013-12-29 08:11:52 发布

阅读量639

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/kingoverlord/article/details/17649889

本文介绍了一种使用ArrayList和LinkedList实现的二叉树层级遍历算法。该算法通过逐层遍历的方式，将每层节点按顺序存入列表中，便于后续处理。文中提供了完整的代码实现，并附带测试函数来展示遍历结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

static ArrayList<LinkedList<Node>> mygetLevelNode(Node root)
	{
		//initial the linked list
		ArrayList<LinkedList<Node>> result = new ArrayList<LinkedList<Node>>();
		
		LinkedList<Node> ll = new LinkedList<Node>();
		
		ll.add(root);
		
		int level = 0;
		result.add(level,ll);
		
		while(true)
		{
			//for every row there is a linked list we firstly create it 
			LinkedList<Node> ll2 = new LinkedList(); 
			
			for(int j = 0;j<result.get(level).size();++j)// level will ++ in the behind; we only get the "former" level
				{
					Node n = result.get(level).get(j);
					if(n.left_child!=null) ll2.add(n.left_child);
					if(n.right_child!=null) ll2.add(n.right_child);
				}
			
			level++;
			if(ll2.size()>0)
			{
				result.add(level,ll2);
			}
			else
			{// if the ll2.size <= 0 that is means we reach the lowest-level-leaves so we break the while(true) loop
				break;
			}
		}
		return result;
	}

test function ::

ArrayList<LinkedList<Node>> findLinkedLeve = mygetLevelNode(root);
		for(LinkedList<Node> n:findLinkedLeve)
		{
			System.out.println("same linked list");
			for(int i = 0;i<n.size();++i)
			{
				Node temp = n.get(i);
				System.out.print(temp.data+" -> ");
			}
		}