针对树这一数据结构的遍历问题主要有四种,前序遍历、中序遍历、后序遍历、层序遍历,我们主要说明一下二叉树前序、中序、后序的递归方式代码模板。
基本思想
前序遍历:根结点 —> 左子树 —> 右子树
中序遍历:左子树—> 根结点 —> 右子树
后序遍历:左子树 —> 右子树 —> 根结点
前序遍历:EBADCGFH
中序遍历:ABCDEFGH
后序遍历:ACDBFHGE
前序遍历
//前序遍历
//获取整个树中所有的键
public Queue<Key> preErgodic(){
Queue<Key> keys = new Queue<>();
preErgodic(root,keys);
return keys;
}
//获取指定树x的键,放到keys队列中
public void preErgodic(Node x, Queue<Key> keys){
if(x==null){
return;
}
//把树x的节点放进队列keys中
keys.enqueue(x.key);
//遍历左子树
if(x.left!=null){
preErgodic(x.left,keys);
}
//遍历右子树
if(x.right!=null){
preErgodic(x.right,keys);
}
}
中序遍历
//中序遍历
public Queue<Key> midErgodic(){
Queue<Key> keys = new Queue<>();
midErgodic(root,keys);
return keys;
}
public void midErgodic(Node x,Queue<Key> keys){
if(x==null){
return;
}
//左子树
if(x.left!=null){
midErgodic(x.left,keys);
}
//节点
keys.enqueue(x.key);
//右子树
if(x.right!=null){
midErgodic(x.right,keys);
}
}
后序遍历
//后序遍历
public Queue<Key> afterErgodic(){
Queue<Key> keys = new Queue<>();
afterErgodic(root,keys);
return keys;
}
public void afterErgodic(Node x,Queue<Key> keys){
if(x==null){
return;
}
//左
if(x.left!=null){
afterErgodic(x.left,keys);
}
//右
if(x.right!=null){
afterErgodic(x.right,keys);
}
keys.enqueue(x.key);
}
测试
package cn.itcast.algorithm.tree;
import cn.itcast.algorithm.queue.Queue;
public class 遍历Test {
public static void main(String[] args) {
//创建树对象
BinaryTree<String, String> tree = new BinaryTree<>();
tree.put("E","5");
tree.put("B","2");
tree.put("G","7");
tree.put("A","1");
tree.put("D","4");
tree.put("F","6");
tree.put("H","8");
tree.put("C","3");
//前序遍历
Queue<String> keys1=tree.preErgodic();
for(String key:keys1){
String value=tree.get(key);
System.out.println(key+"-----"+value);
}
System.out.println("----------------------");
//中序遍历
Queue<String> keys2=tree.midErgodic();
for(String s:keys2){
String value=tree.get(s);
System.out.println(s+"-----"+value);
}
System.out.println("----------------------");
//后序遍历
Queue<String> keys3=tree.afterErgodic();
for (String S:keys3){
String value=tree.get(S);
System.out.println(S+"-----"+value);
}
}
}