2014.3.6-C 어학 학습 결산

2563 단어 C 언어
체인 테이블 베이스:
   :

	1.    

	2.        		llist_append_node

	3.     		llist_print_each

	4.        

	5.        

	6.     

	7.    





==========================

    

	1.       

	  1)  

	  2)  

	  3)  

	  4)  

	  5)  

	2.       

	  1)         

			1 2 3 5 6 0 0

			1 2 3 4 9 5 6

			1 2 3 4 9 5 6 0

	  2)                  

	  3)       

==========================

    

	1.     

	     (Linked list)            ,      

	2.     

	        ,    

	3.      

==========================

          

	1.           

	2.        

	4.       

void llist_append_node

			(struct node *head, 

		          struct node *new)

void llist_change_node(struct node *head, 

			             int id, 

			             char *name)

		append	*

		insert  *

		search	*

		change

		delete

		destory

		print_all  *

		print_node



	5.      append

	  :            

==========================

     

	1. llist_print_each  

	void llist_print_each(struct node *head);

	   :

	      1.        

	      2.          

==========================

        

	1. llist_search_node  

struct node *llist_search_node(struct node *head, int id)

void llist_print_node(struct node *nd)

	  1)    

	  2)                   

	  3)      

	    :

		1.    id     ,      

	2.change  

	  1)          

	  2)        

		1.    id     

==========================

        

	1. llist_insert_node  

void llist_insert_node(struct node *head,

			            struct node *nd, int id)

	  1)       

	  2)       

	    :

			    10   

			id=3,id=4 <== tmp

			       id=1

	       1.                    

	       2.                     

	2.delete  

void llist_delete_node(struct node *head, int id);

	  1)             

	  2)      

	    :

		1.  id 1  

		2.  id 10  

		3.  id 5  

==========================

    

	1.destory  

	int llist_destory(struct node *head);

	 1)             

	     :               

	   :

	              

==========================

    

	H->A->B->C->D->E

	   ^  ^	 ^  

	   p  pp  t

	1.inverse  

void llist_inverse(struct node *head);

	   :

	     1.               ,        

==========================

     

	1.   

	2.    

==========================

        ,     10     

1.         

		  ,  ,  ,  ,       

2.  :

	1)      

	2)         

	3)         ,    

	4)               

	5)        

	6)      

	========================

	enume menu{

			EXIT, ADD, SONE, SALL, 

		         INSERT, DEL, DELALL};

	1.    

	2.        

	3.        

	4.    

	5.        

	6.    

	0.    


좋은 웹페이지 즐겨찾기