二叉树的前序遍历

递归版本：

public static void preOrderRecur(Node head){
    if(head == null) return;
    System.out.print(head.value + ",");
    preOrderRecur(head.left);
    preOrderRecur(head.right);
}

迭代版本：

public static void preOrderRecur(Node head){
    if(head == null) return;
    if(head != null){
        Stack<Node> stack = new Stack<>();
        stack.push(head);
        while(!stack.isEmpty()){
            head = stack.pop();
            System.out.print(head.value + ",");
            if(head.right!= null){
                stack.push(head.right);
            }
            if(head.left != null){
                stack.push(head.left);
            }            
        }
    }
    System.out.println();    
}