@Lvhau_1529/

DesertedJuvenileAttribute

C++

No description

fork
loading
Files
  • main.cpp
main.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
#include <iostream>
#include <stdio.h>

/* //Cay nghi phan
using namespace std;

struct node
{
  char infor;
  node *left, *right;
};

void preOrder(node *T);

//===chuong trinh chinh===
int main()
{
  node *T=NULL;

  cout<<endl;
  return 0;
}
//===dinh nghia ham===
void preOrder(node *T)
{
  if(T==NULL){
    return;
  }
  else {
    cout<<T->infor<<"  ";
    preOrder(T->left);
    preOrder(T->right);
  }
}
*/

/* //Dslkd
using namespace std;

//Khai bao kieu cau truc node cua DSLKD
struct node
{
  int infor;
  node *link;
};

//Cai dat phep toan tren DSLKD
void SLInsert(node* &F,node *M,int x);
void SLDisplay(node *F);

//===chuong trinh chinh===
int main()
{
  //Cai dat cau truc luu tru cua DSLKD
  node *F=NULL;


  cout<<endl;
  return 0;
}
//===dinh nghia ham===
void SLInsert(node* &F,node *M,int x)
{
  //1.Tao nut moi
  node *N = new node;
  N->infor = x;
  N->link = NULL;

  //2.Truong hop DSLKD rong
  if(F==NULL)
  {
    F=N;
    return;
  }

  //3.Truong hop con lai
  if(M==F)  //M la nut dau tien
  {
    N->link=F;
    F = N;
  }
  else
  {
    //Tim den nut truoc M
    node *P=F;
    while(P->link != M) P=P->link;

    //Noi nut N vao truoc M
    P->link = N;
    N->link = M;
  }
}

void SLDisplay(node *F)
{


}
*/