递归版本:
public static void reversePos(Node head){
if (head == null)
return;
reversePos(head.left);
System.out.print(head.value+",");
reversePos(head.right);
}
非递归版本:
public static void unReversePos(Node head){
if (head != null){
Stack<Node> stack = new Stack<>();
while (!stack.isEmpty() || head != null){
if (head != null ){
stack.push(head);
head = head.left;
}else {
head = stack.pop();
System.out.print(head.value+",");
head = head.right;
}
}
}
}