목록#링크트리스트자료구조 (1)

A sentimental robot

Single LinkedList Exercise2

#include #include #pragma warning(disable:4996) typedef struct Node { int data; struct Node* next; }Node; void disp(struct Node *root); int Insert(struct Node*root, int position); //추가 , Index [position]에 삽입한다. int Delete(struct Node*root, int position); //삭제, Index [position]을 삭제한다. int SetData(struct Node*root, int position, int data); // Index [position]에 data를 set int GetData(struct Node*roo..
Data Structure 2018. 1. 3. 11:51
이전 Prev 1 Next 다음