二叉树的后序遍历

递归：

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

迭代：

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