Àà×öÁ´±í Ôõô×ö

lianeh

ÀÏʦ»¹Ã»½²Ôõô×ö
µ«ÎҸоõºÍ½á¹¹²î²»¶àѽËùÒÔÌáÇ°×öÁË
Ôõô×ÜÊÇÌáÐÑÀàÄÚÁ¬½ÓÖ¸ÕëûÓÐÉùÃ÷;

ΪÄãÖ´Öø

Ŷ
ÖªµÀÁË
лл°ßÖñ ÎÒ»¹ÒÔΪÓÃÀàµÄÃû×Ö×öÄØ
Ô­À´ÕâÑù....
Ê®·Ö¸Ðл

ÏëÄî~£¡

ÀàÊÇ°ÑÊý¾ÝºÍ·½·¨·â×°ÆðÀ´.

1. struct Node //Á´±íµÄ½Úµã
   
2. {
   
3. int data;
   
4. Node *next;
   
5. };
   
6. 
   
7. //ÀàÉùÃ÷
   
8. class List
   
9. {
   
10. private:
    
11. Node *head;
    
12. Node *tail;
    
13. public:
    
14. List();
    
15. ~List();
    
16. void addToTail(int);
    
17. void deleteFromTail();
    
18. };
    
19. 
    
20. //Àà·½·¨µÄ¶¨Òå
    
21. List::List() //¹¹Ôì
    
22. {
    
23. head = tail = 0;
    
24. }
    
25. List::~List() //Îö¹¹
    
26. {
    
27. Node *p;
    
28. while(head != 0)
    
29. {
    
30. p = head->next;
    
31. delete head;
    
32. head = p;
    
33. }
    
34. }
    
35. 
    
36. void List::addToTail(int x) //Ôö¼Óµ½½áβ
    
37. {
    
38. Node *tmp = new Node;
    
39. tmp->data = x;
    
40. tmp->next = 0;
    
41. if(tail != 0)
    
42. {
    
43. tail->next = tmp;
    
44. tail = tail->next;
    
45. }
    
46. else
    
47. head = tail = tmp;
    
48. }
    
49. void List::deleteFromTail() //´Ó½áβɾ³ý
    
50. {
    
51. if(head == 0)
    
52. return;
    
53. else if(head == tail)
    
54. {
    
55. delete tail;
    
56. head = tail = 0;
    
57. }
    
58. else
    
59. {
    
60. Node *tmp = head;
    
61. while(tmp->next != tail)
    
62. tmp = tmp->next;
    
63. 
    
64. delete tail;
    
65. tail = tmp;
    
66. tail->next = 0;
    
67. }
    
68. }

¸´ÖÆ´úÂë

¿ÉÒÔÔÚListÖмÓÈëÆäËûµÄÐèÒªµÄ·½·¨

ʹÓÃʱ,Èç

List a; //¶¨ÒåÁËÁ´±íÒ»¸ö¶ÔÏó
a.addToTail(5); //aµ÷ÓóÉÔ±º¯Êý
a.deleteFromTail();

ÓðÒ¶ÀÎè

class student *pr=NULL;
class student *pl=NULL;

½ðÂí

class student
{
int x;
.....
public:
...
class student *pr;
class student *pl;
};

»Ê¼Ò©IºØv

¿´Ò»ÏÂÄãµÄÀà