树的遍历

1. 根据二叉树的前序和中序建树

public TreeNode createTree(String preOrder,String inOrder){
        if(preOrder.isEmpty()){
            return null;
        }
        char rootValue = preOrder.charAt(0);
        int rootIndex = inOrder.indexOf(rootValue);

        TreeNode root = new TreeNode(rootValue);
        root.setLeft(createTree(preOrder.substring(1,1+rootIndex),inOrder.substring(0,rootIndex)));

        root.setRight(createTree(preOrder.substring(1+rootIndex),inOrder.substring(1+rootIndex)));
        return root;
    }

2. 根据前序和中序直接得到后序

public String postOrder(String preOrder,String inOrder){
        if(preOrder.isEmpty()){
            return "";
        }

        char rootValue = preOrder.charAt(0);
        int rootIndex = inOrder.indexOf(rootValue);

        return postOrder(preOrder.substring(1,1+rootIndex),
                inOrder.substring(0,rootIndex)) +
                postOrder(preOrder.substring(1+rootIndex),
                        inOrder.substring(1+rootIndex)) +
                rootValue;

    }

3. 树的前序遍历

public void preOrder(TreeNode root){
        if(root == null){
            return;
        }
        System.out.print(root.getValue());
        preOrder(root.getLeft());
        preOrder(root.getRight());
    }

4. 找到树中序遍历的下一个

//找到该树的最左边的那个节点，输入是根节点

//找到这个树的最左边的一个
    public TreeNode first(TreeNode node){
        if(node == null){
            return null;
        }
        TreeNode curNode = node;
        while(curNode.getLeft() != null){
            curNode = curNode.getLeft();
        }
        return curNode;
    }

//永远只关心此节点的下一个节点

public TreeNode next(TreeNode node){
        if(node == null){
            return null;
        }
        if(node.getRight() != null){//判断有没有右子树
            return first(node.getRight());
        }else {
            while(node.getParent() != null  //最后会遍历到根节点，防止出现空指针
                    && node.getParent().getRight() == node){
                node = node.getParent();
            }
            return node.getParent();
        }
    }

//进行遍历

public void tracerse(TreeNode root){

        for(TreeNode node = first(root);node!=null
                ;node=next(node)){

            System.out.print(node.getValue());
        }
        System.out.println();
    }

5. 算法复杂度