package java程序员面试笔试宝典;


import java.util.Stack;


public class 题8_1_5从尾到头输出单链表{
public static void main(String[] args) {
题8_1链表基本操作 list=new 题8_1链表基本操作();
list.addNode(3);
list.addNode(2);
list.addNode(1);
list.addNode(8);
list.addNode(7);
list.addNode(13);
list.addNode(0);
list.printList();
System.out.println();
System.out.println();
printListReversely1(list.head);
}
public static void printListReversely1(Node head){
Stack<Integer> st=new Stack<Integer>();
Node p=head;
while(p!=null){
st.push(p.data);
p=p.next;
}
while(!st.isEmpty()){
System.out.print(st.pop()+"  ");
}
}
public static void printListReversely0(Node head){
if(head.next!=null){
printListReversely(head.next);
}
System.out.println(head.data);
}
public static void printListReversely(Node head){
if(head!=null){
printListReversely(head.next);
System.out.print(head.data+"  ");
}
}
}