typedef struct link int data struct link next

  • Slides: 19
Download presentation

רשימה משורשרת typedef struct link{ int data; struct link * next; }link;

רשימה משורשרת typedef struct link{ int data; struct link * next; }link;

העומד בתור התאורטי void insert. Last(link * head, link * new. Link){ while

העומד בתור התאורטי void insert. Last(link * head, link * new. Link){ while (head->next!=NULL) head=head->next; head->next=new. Link; new. Link->next=NULL; }

" "אני אחריך void insert. After (link *where, link *new. Link){ new. Link->next=where->next; where->next=new.

" "אני אחריך void insert. After (link *where, link *new. Link){ new. Link->next=where->next; where->next=new. Link; }

" "אני לפניך link * insert. Before (link *head, link *where, link *new. Link){

" "אני לפניך link * insert. Before (link *head, link *where, link *new. Link){ if (head==where){ new. Link->next=head; return new. Link; } while (head->next!=where) head=head->next; new. Link->next=head->next; head->next=new. Link; return head; }

" "אני רק שאלה link * insert. First (link *head, link *new. Link){ new.

" "אני רק שאלה link * insert. First (link *head, link *new. Link){ new. Link->next=head; return new. Link; }

פונקציות עזר void print. List(link *head){ while (head){ printf("%d -> ", head->data); head=head->next;

פונקציות עזר void print. List(link *head){ while (head){ printf("%d -> ", head->data); head=head->next; } printf("n"); } link * create. Link(int data, link * next){ link * l=(link *)malloc(sizeof (link)); if (l){ l->data=data; l->next=next; } return l; }

main void main(){ link * head; head=create. Link(5, NULL); print. List(head); head=insert. First(head, create.

main void main(){ link * head; head=create. Link(5, NULL); print. List(head); head=insert. First(head, create. Link(7, NULL)); print. List(head); insert. Last(head, create. Link(9, NULL)); print. List(head); head=insert. Before(head, head->next, create. Link(3, NULL)); print. List(head); insert. After(head->next, create. Link(4, NULL)); print. List(head); }

"? ? "יש כרטיס מועדון link * remove. First(link * head){ link *temp=head; head=head->next;

"? ? "יש כרטיס מועדון link * remove. First(link * head){ link *temp=head; head=head->next; free(temp); return head; }

משפרי עמדה link * remove. Last(link * head){ link * temp=head; if (head->next==NULL){

משפרי עמדה link * remove. Last(link * head){ link * temp=head; if (head->next==NULL){ free(head); return NULL; } while (head->next != NULL) head=head->next; free(head->next); head->next=NULL; return temp; }

" "שכחתי לקנות במבה link * remove. Link(link *head, link *to. Remove){ link *

" "שכחתי לקנות במבה link * remove. Link(link *head, link *to. Remove){ link * temp=head; if (head==to. Remove) return remove. First(head); while (head->next != to. Remove) head=head->next; head->next=head->next; free(to. Remove); return temp; }

void הפיכת פונקציה ל link * insert. First(link *head, link *new. Link){ new. Link->next=head;

void הפיכת פונקציה ל link * insert. First(link *head, link *new. Link){ new. Link->next=head; return new. Link; } void insert. First(link **head, link *new. Link){ new. Link->next=*head; *head=new. Link; }

הסתכלות רקורסיבית int find. Max(link * head){ int rest. Max; if (head==NULL) return

הסתכלות רקורסיבית int find. Max(link * head){ int rest. Max; if (head==NULL) return 0; rest. Max = find. Max(head->next); if (rest. Max > head->data) return rest. Max; return head->data; }

הגדרת המבנה typedef struct dlink{ int data; struct dlink * next; struct dlink

הגדרת המבנה typedef struct dlink{ int data; struct dlink * next; struct dlink * prev; }dlink;

הוספת חוליה void insert. After 1 (dlink *where, dlink *new. Link){ new. Link->next=where->next;

הוספת חוליה void insert. After 1 (dlink *where, dlink *new. Link){ new. Link->next=where->next; new. Link->prev=where; if (where->next!=NULL){ where->next->prev=new. Link; } where->next=new. Link; }

מחיקת חוליה dlink *remove. Link 1(dlink *head, dlink *to. Remove){ if (to. Remove->next

מחיקת חוליה dlink *remove. Link 1(dlink *head, dlink *to. Remove){ if (to. Remove->next != NULL) to. Remove->next->prev = to. Remove->prev; if (to. Remove->prev != NULL) to. Remove->prev->next = to. Remove->next; else head=to. Remove->next; free(to. Remove); return head; }

typedef u typedef l typedef typedef struct charlistnodetypedef u typedef l typedef typedef struct charlistnode
typedef typedef typedef int INTEGER int i jtypedef typedef typedef int INTEGER int i j
typedef typedef typedef int INTEGER int i jtypedef typedef typedef int INTEGER int i j
typedef n n n n typedef typedef typedeftypedef n n n n typedef typedef typedef
typedef typedef struct date int year int monthtypedef typedef struct date int year int month
struct node struct node next typedef struct nodestruct node struct node next typedef struct node
typedef typedef struct data int x double ytypedef typedef struct data int x double y
typedef struct int xsize int ysize int leveltypedef struct int xsize int ysize int level
typedef struct int xsize int ysize int leveltypedef struct int xsize int ysize int level
typedef struct listnode int value struct listnode nexttypedef struct listnode int value struct listnode next
3 1 typedef typedef struct char name100 int3 1 typedef typedef struct char name100 int
typedef int Int A10 Int A a Inttypedef int Int A10 Int A a Int
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
typedef struct Tree Node int data struct Treetypedef struct Tree Node int data struct Tree
insertanode B typedef struct node int data structinsertanode B typedef struct node int data struct
2394 typedef struct Tree Node int data struct2394 typedef struct Tree Node int data struct
5 Node typedef struct Node int val struct5 Node typedef struct Node int val struct
struct linked int data struct linked prev structstruct linked int data struct linked prev struct