1 public void nizhi()//鏈表的逆置
 2 
 3 {
 4 
 5   Node T1,T2=head;//head是定義的頭結點.
 6 
 7   T2=head.Next;   
 8 
 9   head.Next=null;
10 
11 while(T2!=null) 
12 
13 {
14 
15   T1=T2.Next;
16 
17   T2.Next=head.Next;
18 
19   head.Next=T2;
20 
21   T2=T1;
22 
23  
24 
25 }
26 
27 }
28 
29  
30 
31 public int RemoveMin()
 
32 
33 {
34 
35    Node dpm,dm,pm,m;//  dpm是所要刪除的前一個,dm是所需要刪除的值.   m是當前最小值 . pm是當前最小值的前一個.
36 
37    dpm=pm=head;
38 
39    dm=m=head.Next;
40 
41 while(m!=null)
42 
43    {
44 
45       if (dm.data>m.data)
46 
47     {  dm=m;
48 
49       dpm=pm;
50 
51     }
52 
53    m=m.Next;
54 
55    pm =pm.Next;
 
56 
57   }
58 
59  
60 
61   dpm.Next=dpm.Next.Next;
62 
63  dm.Next =null;
64 
65 return dm.data;
66 
67 }  
68 
69   

鏈表刪除最小值,倒敘