二叉树遍历(递归和非递归)
一、递归实现二叉树的三种遍历
示例:使用递归实现二叉树的先序, 中序, 后序遍历
public class binaryTree {
void preOrder1(Node root){
//先序遍历 根左右
if(root==null)return;
System.out.print(root.Value+" ");
preOrder1(root.left);
preOrder1(root.right);
}
void midOrder1(Node root){
//中序遍历 左根右
if(root==null)return;
midOrder1(root.left);
System.out.print(root.Value+" ");
midOrder1(root.right);
}
void postOrder1(Node root){
//后序遍历 左右根
if(root==null)return;
postOrder1(root.left);
postOrder1(root.right);
System.out.print(root.Value+" ");
}
}
public class Test {
public static void main(String[] args) {
Node nodeA=new