二叉树的4种遍历实现（递归与非递归） Java

假设已生成如下二叉树：

二叉树的生成，可参考https://blog.csdn.net/michiko98/article/details/105211760

 

按照先序、中序、后序、层序4种方式进行遍历：

不同排序方式，排序结果应为：

先序排列：根--左--右，10,3,0,7,5，20,33，27,100

中序排列：左--根--右，0,3,5,7,10,20,27,33,100（二叉排序树的中序遍历，为升序排列）

后序排列：左--右--根，0,5,7,3,27,100,33,20,10

层序排列：一层一层往下排列，10,3,20,0,7,33,5,27,100

递归具体实现方式如下：

public static void main(String[] args) {
		BinaryTreeNode node = null;
		int[] array = { 10, 3, 20, 7, 5, 33, 27, 100, 0 };
		for (int i = 0; i < array.length; i++) {
			node = new BinaryTreeNode(array[i]);
			addTreeNode(node);
		}
		inOrderTraversal();
	}

	/**
	 * 遍历二叉树
	 */
	private static void inOrderTraversal() {
		if (root == null) {
			return;
		}
		System.out.print("中序遍历：");
		middleOrder(root);
		System.out.print("先序遍历：");
		prevOrder(root);
		System.out.print("后序遍历：");
		afterOrder(root);
		System.out.print("层序遍历：");
		layerOrder(root);
	}

	// 中序遍历
	private static void middleOrder(BinaryTreeNode current) {
		if (current.getLeft() != null) {
			// 遍历左子树
			middleOrder(current.getLeft());
		}
		System.out.print(current.getInfo() + ",");
		if (current.getRight() != null) {
			// 遍历右子树
			middleOrder(current.getRight());
		}
	}

	// 先序遍历
	private static void prevOrder(BinaryTreeNode current) {
		System.out.print(current.getInfo() + ",");
		if (current.getLeft() != null) {
			// 遍历左子树
			prevOrder(current.getLeft());
		}
		if (current.getRight() != null) {
			// 遍历右子树
			prevOrder(current.getRight());
		}
	}

	// 后序遍历
	private static void afterOrder(BinaryTreeNode current) {
		if (current.getLeft() != null) {
			// 遍历左子树
			afterOrder(current.getLeft());
		}
		if (current.getRight() != null) {
			// 遍历右子树
			afterOrder(current.getRight());
		}
		System.out.print(current.getInfo() + ",");
	}

	// 层序遍历
	private static void layerOrder(BinaryTreeNode current) {
		LinkedList<BinaryTreeNode> mList = new LinkedList<BinaryTreeNode>();
		mList.add(current);
		BinaryTreeNode currentNode;
		while (!mList.isEmpty()) {
			currentNode = mList.poll();
			System.out.print(currentNode.getInfo() + ",");
			if (currentNode.getLeft() != null) {
				mList.add(currentNode.getLeft());
			}
			if (currentNode.getRight() != null) {
				mList.add(currentNode.getRight());
			}
		}
	}

非递归实现方式待更新。