fw - pre_order_traverse - 2013年12月17日13:36:58 - java version

kingoverlord

于 2013-12-18 02:36:35 发布

阅读量729

点赞数

CC 4.0 BY-SA版权

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

本文详细介绍了构建树与图的基本实现过程，包括节点类的定义、构建树的方法及前序遍历的实现。

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

package test_kepler;

public class Treeandgraph {
	
	class Node
	{
		public Node left_child;
		public Node right_child;
		public String data;
		public Node()
		{
			left_child = null;
			right_child = null;
			data = null;
		}
	};
	
	 Node buildTree()
	{
		Node root = new Node();
		root.data = "root";
		Node t1 = new Node();
		t1.data = "t1";
		Node t2 = new Node();
		t2.data = "t2";
		Node t3 = new Node();
		t3.data = "t3";
		Node t4 = new Node();
		t4.data = "t4";
		Node t5 = new Node();
		t5.data = "t5";
		
		root.left_child = t1;
		root.right_child = t2;
		t1.left_child = t3;
		t1.right_child = t4;
		t2.left_child = t5;
		
		return root;
	}
	//head - right - left;
	static void traverse_pre_order(Node nd)
	{
		if(nd != null)
		{
			System.out.print(nd.data+" ->> ");
			traverse_pre_order(nd.right_child);
			traverse_pre_order(nd.left_child);
		}
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Treeandgraph tg = new Treeandgraph();
		traverse_pre_order(tg.buildTree());
	}

}