一个简单二叉树及先序中序后续遍历的实现

最新推荐文章于 2024-09-19 22:11:40 发布

原创最新推荐文章于 2024-09-19 22:11:40 发布 · 172 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#二叉树

基础专栏收录该内容

2 篇文章

订阅专栏

本文深入探讨了二叉树的前序、中序和后序遍历算法，通过具体的代码实现展示了每种遍历方式的特点及应用。文章首先定义了二叉树节点的数据结构，然后构建了一个简单的二叉树实例，并使用递归方法实现了三种遍历方式。

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

package testcase;

class Node{
	private Object data;
	private Node leftChild;
	private Node rightChild;
	public Object getData() {
		return data;
	}
	public void setData(Object data) {
		this.data = data;
	}
	public Node getLeftChild() {
		return leftChild;
	}
	public void setLeftChild(Node leftChild) {
		this.leftChild = leftChild;
	}
	public Node getRightChild() {
		return rightChild;
	}
	public void setRightChild(Node rightChild) {
		this.rightChild = rightChild;
	}
	public Node(Object data) {
		super();
		this.data = data;
	}
}

public class BinTree {
	public static void main(String[] args) {
		Node n1=new Node(10);
		Node n2=new Node(9);
		Node n3=new Node(20);
		Node n4=new Node(15);
		Node n5=new Node(35);
		
		n1.setLeftChild(n2);
		n1.setRightChild(n3);
		n3.setLeftChild(n4);
		n3.setRightChild(n5);
		
		BinTree br=new BinTree();
		br.preOrder(n1);
		System.out.println();
		br.inOrder(n1);
		System.out.println();
		br.postOrder(n1);
	}
	public void preOrder(Node current){
		if(current!=null){
			System.out.print(current.getData()+" ");
			preOrder(current.getLeftChild());
			preOrder(current.getRightChild());
		}
	}
	public void inOrder(Node current){
		if(current!=null){
			inOrder(current.getLeftChild());
			System.out.print(current.getData()+" ");
			inOrder(current.getRightChild());
		}
	}
	public void postOrder(Node current){
		if(current!=null){
			postOrder(current.getRightChild());
			postOrder(current.getLeftChild());
			System.out.print(current.getData()+" ");
		}
	}
}