递归遍历二叉树
在这里插入代码package class07;
/*
* 二叉树的递归遍历:【递归序】
* :每一个结点在递归的时候会来到三次,开始递归:遍历左树回来;遍历右数回来
* if:head==null:return
* sout:head.value;
* pre:(head.left)
* pre:(head.right)
* */
/*
* Recurive:递归:Traversal遍历
* */
public class RecuriveTraversalBT {
public static class Node{
int value;
Node left;
Node right;
public Node(int value){
this.value=value;
}
}
//先序
public static void preTraversal(Node head){
if(head==null) return;
//思路:先打印中间,再去处理左边,最后处理右边;递归强大可以让你处理一次递归的事情,后面的所有递归自然解决
System.out.println(head.value);
preTraversal(head.left);
preTraversal(head.right);
}
public static void inTraversal(Node head){
if(head==null) return;
preTraversal(head.left);
System.out.println(head.value);
preTraversal(head.right);
}
public static void posTraversal(Node head){
if(head==null) return;
preTraversal(head.left);
preTraversal(head.right);
System.out.println(head.value);
}
public static void main(String[] args){
Node node1=new Node(1);
Node node2=new Node(2);
Node node3=new Node(3);
node1.left=node2;
node1.right=node3;
Node node4=new Node(4);
Node node5=new Node(5);
node2.left=node4;
node2.right=node5;
Node node6=new Node(6);
Node node7=new Node(7);
node3.left=node6;
node3.right=node7;
preTraversal(node1);
}
}
片