二叉树前序遍历

1.建立TreeNode类：

public class TreeNode {
   public int val;
   public TreeNode left;
   public TreeNode right;

    public  TreeNode(int val){
        this.val = val;
    }
}

 

2.前序遍历：

/**
 * @author oulei
 * 二叉树前序遍历 -- 根左右
 */
public class PreOrderTraversal {

    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(3);
        TreeNode node4 = new TreeNode(4);
        TreeNode node5 = new TreeNode(5);
        TreeNode node6 = new TreeNode(6);
        TreeNode node7 = new TreeNode(7);

        node4.left = node2;
        node4.right = node6;

        node2.left = node1;
        node2.right = node3;

        node6.left = node5;
        node6.right = node7;

        // 非递归调用
        // normalPreOrderTraversal(node4);
        // 递归调用
        recursionPreOrderTraversal(node4);
    }

    /**
     * 非递归形式
     */
    public  static void normalPreOrderTraversal(TreeNode root){
        Stack<TreeNode> stack = new Stack<>();
        TreeNode node = root;
        while (node != null || stack.size() > 0){
            if (node != null){
                System.out.println(node.val);
                stack.push(node);
                node = node.left;
            }else {
                TreeNode tem = stack.pop();
                node = tem.right;
            }

        }
    }


    /**
     * 递归实现
     */
    public static  void recursionPreOrderTraversal(TreeNode node){
        System.out.println(node.val);
        if (node.left != null){
            recursionPreOrderTraversal(node.left);
        }
        if (node.right != null){
            recursionPreOrderTraversal(node.right);
        }
    }

}