java实现二叉树的前，中，后序遍历

java运用递归和非递归两种方法实现二叉树的前，中，后序遍历

前言知识

树的遍历方式

深度优先搜素：

在搜索树的每一层始终只扩展一个子节点，不断地向下一层前进（到达叶子节点或受到深度限制时），才从当前节点返回到上一级节点，沿着另外一个方向继续前进

广度优先搜素

深度越大的节点越先得到扩展，本层的节点没有搜素处理完时，不能对下层节点进行处理。

参考力扣习二叉树遍历习题描述

定义一个树

public class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
         this.val = val;
         this.left = left;
         this.right = right;
     }
 }

前序遍历

递归实现

class Solution {
    List<Integer> list = new ArrayList<>();
    public List<Integer> preorderTraversal(TreeNode root) {
        if(root == null) return list;
             list.add(root.val);
             preorderTraversal(root.left);
             preorderTraversal(root.right);
             return list;
    }
}

非递归实现

void preorderTraversal(TreeNode root){
        if (root == null) return;
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        while (cur != null || !stack.empty()){
            while(cur != null){
                stack.push(cur);
                System.out.print(cur.val + "");
                cur = cur.left;
            }
            TreeNode top = stack.pop();
            cur = top.right;
        }
    }

中序遍历

递归实现

class Solution {
    List<Integer> list = new ArrayList<>();
    public List<Integer> inorderTraversal(TreeNode root) {
         if(root == null) return list;
            inorderTraversal(root.left);
            list.add(root.val);
            inorderTraversal(root.right);
             return list;
    }
}

非递归实现

void inorderTraversal(TreeNode root){
        if (root == null) return;
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        while (cur != null || !stack.empty()){
            while(cur != null){
                stack.push(cur);
                cur = cur.left;
            }
            TreeNode top = stack.pop();
            System.out.print(top.val + "");
            cur = top.right;
        }
    }

后序遍历

递归实现

class Solution {
    List<Integer> list = new ArrayList<>();
    public List<Integer> postorderTraversal(TreeNode root) {
         if(root == null) return list;
             postorderTraversal(root.left);
             postorderTraversal(root.right);
             list.add(root.val);
             return list;
    }
}

非递归实现

    void postorderTraversal(TreeNode root){
        if (root == null) return;
        Stack<TreeNode> stack = new Stack<>();
        TreeNode cur = root;
        TreeNode prev = null;
        while (cur != null || !stack.empty()){
            while(cur != null){
                stack.push(cur);
                cur = cur.left;
            }
            TreeNode top = stack.peek();
            if (top.right == null || top.right==prev) {
                stack.pop();
                System.out.println(top.val + "");
                prev = top;
            }else{
                cur = top.right;

        }
      }
     }

二叉树的层序遍历

class Solution {
    public List<List<Integer>> levelOrder(TreeNode root) {
        List<List<Integer>> ret = new ArrayList<>();
        if(root == null) return ret;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        while(!queue.isEmpty()){
            //存放每一层数据
            List<Integer> list = new ArrayList<>();
            int size = queue.size();
            while(size >0){
                TreeNode cur = queue.poll();
                 list.add(cur.val);
                 if(cur.left != null){
                     queue.offer(cur.left);
                 }
                 if(cur.right != null){
                     queue.offer(cur.right);
                 }
                 size--;
            }
            ret.add(list);
        }
        return ret;
    }
}

判断一个树是不是完全二叉树

//判断一棵树是不是完全二叉树
 public  boolean isComplateTree (BTNode root){
    if(root == null){
        return true;
    }
    Queue<BTNode> queue = new LinkedList<>();
    queue.offer(root);
    while ( !queue.isEmpty()){
        BTNode cur = queue.poll();
        if(cur != null ){
            queue.offer(cur.left);
            queue.offer(cur.right);
        }else {
            break;
        }
    }
    while( !queue.isEmpty()){
        BTNode cur = queue.peek();
        if(cur != null){
            return  false;
        }else{
            queue.poll();
        }
    }
    return true;
}

从前序与中序遍历序列构造二叉树

class Solution {
    public int preindex = 0;

    public TreeNode buildTreeChid(int[] preorder, int[] inorder,int inbegin,int inend) {
        if(inbegin >inend){
            return null;
        }
        TreeNode root = new TreeNode(preorder[preindex]);
        //在中序遍历的数组当中，找打当前根节点所在的位置
        int index = findValInorder(inorder,preorder[preindex],inbegin, inend);
        preindex++;
        root.left = buildTreeChid(preorder,inorder,inbegin,index-1);
        root.right = buildTreeChid(preorder,inorder,index+1,inend);
        return root;
    }
    public int findValInorder(int[] inorder,int key,int inbegin,int inend){
        for(int i = inbegin;i<=inend;i++){
            if(inorder[i] == key ){
                return i;
            }
        }
        return -1;
    }
    public TreeNode buildTree(int[] preorder, int[] inorder) {
        if(preorder == null || inorder == null) return null;
        int preindex = 0;
        return buildTreeChid(preorder,inorder,0,inorder.length-1);
    }
}

从中序与后序遍历序列构造二叉树

class Solution {
    int posindex = 0;
    public TreeNode buildTreeChild(int[] inorder, int[] postorder,int inbegin,int inend) {
        if(inbegin > inend) return null;
        TreeNode root = new TreeNode(postorder[posindex]);
        int index = findValInorder(inorder,postorder[posindex],inbegin,inend);
        posindex--;
        root.right = buildTreeChild(inorder,postorder,index +1,inend);
        root.left = buildTreeChild(inorder,postorder,inbegin,index-1);
        return root;
    }
    public int findValInorder(int[] inorder,int key,int inbegin,int inend){
        for(int i = inbegin;i<=inend;i++){
            if(key == inorder[i]){
                return i;
            }
        }
        return -1;
    }
    public TreeNode buildTree(int[] inorder, int[] postorder) {
        if(inorder == null || postorder == null) return null;
        posindex = postorder.length-1;
        return buildTreeChild(inorder,postorder,0,inorder.length-1);
    }
}