öλÔÓéÀֵǼÈë¿ÚÏÂÔØ

Êý¾Ý½á¹¹»ù±¾Ó¢Óï´Ê»ã

Êý¾Ý³éÏó data abstraction
Êý¾ÝÔªËØ data element
Êý¾Ý¶ÔÏó data object
Êý¾ÝÏî data item
Êý¾ÝÀàÐÍ data type
³éÏóÊý¾ÝÀàÐÍ abstract data type

Âß¼­½á¹¹ logical structure
ÎïÀí½á¹¹ phyical structure
ÏßÐԽṹ linear structure
·ÇÏßÐԽṹ nonlinear structure

»ù±¾Êý¾ÝÀàÐÍ atomic data type
¹Ì¶¨¾ÛºÏÊý¾ÝÀàÐÍ fixed-aggregate data type
¿É±ä¾ÛºÏÊý¾ÝÀàÐÍ variable-aggregate data type
ÏßÐÔ±í linear list
Õ» stack
¶ÓÁÐ queue
´® string
Êý×é array
Ê÷ tree
ͼ grabh

²éÕÒ£¬ÏßË÷ searching
¸üРupdating
ÅÅÐò£¨·ÖÀà) sorting
²åÈë insertion
ɾ³ý deletion

Ç°Ç÷ predecessor
ºó¼Ì successor
Ö±½ÓÇ°Ç÷ immediate predecessor
Ö±½Óºó¼Ì immediate successor
Ë«¶ËÁбí deque(double-ended queue)
Ñ­»·¶ÓÁÐ cirular queue
Ö¸Õë pointer
ÏȽøÏȳö±í£¨¶ÓÁУ©first-in first-out list
ºó½øÏȳö±í£¨¶ÓÁУ©last-in first-out list
Õ»µ× bottom
Õ»¶¨ top
ѹÈë push
µ¯³ö pop
¶ÓÍ· front
¶Óβ rear
ÉÏÒç overflow
ÏÂÒç underflow

Êý×é array
¾ØÕó matrix
¶àάÊý×é multi-dimentional array
ÒÔÐÐΪÖ÷µÄ˳Ðò·ÖÅä row major order
ÒÔÁÐΪÖ÷µÄ˳Ðò·ÖÅä column major order
Èý½Ç¾ØÕó truangular matrix
¶Ô³Æ¾ØÕó symmetric matrix
Ï¡Êè¾ØÕó sparse matrix
תÖþØÕó transposed matrix

Á´±í linked list
ÏßÐÔÁ´±í linear linked list
µ¥Á´±í single linked list
¶àÖØÁ´±í multilinked list
Ñ­»·Á´±í circular linked list
Ë«ÏòÁ´±í doubly linked list
Ê®×ÖÁ´±í orthogonal list
¹ãÒå±í generalized list

Á´ link
Ö¸ÕëÓò pointer field
Á´Óò link field
Í·½áµã head node
Í·Ö¸Õë head pointer
βָÕë tail pointer
´® string
¿Õ°×£¨¿Õ¸ñ£©´® blank string
¿Õ´®£¨Áã´®£©null string
×Ó´® substring

Ê÷ tree
×ÓÊ÷ subtree
É­ÁÖ forest
¸ù root
Ò¶×Ó leaf
½áµã node
Éî¶È depth
²ã´Î level
Ë«Ç× parents
º¢×Ó children
ÐÖµÜ brother
×æÏÈ ancestor
×ÓËï descentdant

¶þ²æÊ÷ binary tree
ƽºâ¶þ²æÊ÷ banlanced binary tree
Âú¶þ²æÊ÷ full binary tree
ÍêÈ«¶þ²æÊ÷ complete binary tree
±éÀú¶þ²æÊ÷ traversing binary tree
¶þ²æÅÅÐòÊ÷ binary sort tree
¶þ²æ²éÕÒÊ÷ binary search tree
ÏßË÷¶þ²æÊ÷ threaded binary tree
¹þ·òÂüÊ÷ Huffman tree
ÓÐÐòÊý ordered tree
ÎÞÐòÊý unordered tree
Åж¨Ê÷ decision tree
Ë«Á´Ê÷ doubly linked tree
Êý×Ö²éÕÒÊ÷ digital search tree

Ê÷µÄ±éÀú traversal of tree
ÏÈÐò±éÀú preorder traversal
ÖÐÐò±éÀú inorder traversal
ºóÐò±éÀú postorder traversal

ͼ graph
×Óͼ subgraph
ÓÐÏòͼ digraph(directed graph)
ÎÞÏòͼ undigraph(undirected graph)
Íêȫͼ complete graph
Á¬Í¨Í¼ connected graph
·ÇÁ¬Í¨Í¼ unconnected graph
Ç¿Á¬Í¨Í¼ strongly connected graph
ÈõÁ¬Í¨Í¼ weakly connected graph
¼ÓȨͼ weighted graph
ÓÐÏòÎÞ»·Í¼ directed acyclic graph
Ï¡Êèͼ spares graph
³íÃÜͼ dense graph
ÖØÁ¬Í¨Í¼ biconnected graph
¶þ²¿Í¼ bipartite graph

±ß edge
¶¥µã vertex
»¡ arc
·¾¶ path
»Ø·£¨»·£©cycle
»¡Í· head
»¡Î² tail
Ô´µã source
ÖÕµã destination
»ãµã sink
Ȩ weight
Á¬½Óµã articulation point
³õʼ½áµã initial node
Öն˽áµã terminal node
ÏàÁÚ±ß adjacent edge
ÏàÁÚ¶¥µã adjacent vertex
¹ØÁª±ß incident edge
Èë¶È indegree
³ö¶È outdegree
×î¶Ì·¾¶ shortest path
ÓÐÐò¶Ô ordered pair
ÎÞÐò¶Ô unordered pair
¼òµ¥Â·¾¶ simple path
¼òµ¥»Ø· simple cycle
Á¬Í¨·ÖÁ¿ connected component
ÁÚ½Ó¾ØÕó adjacency matrix
ÁÚ½Ó±í adjacency list
ÁÚ½Ó¶àÖرí adjacency multilist
±éÀúͼ traversing graph
Éú³ÉÊ÷ spanning tree
×îС£¨´ú¼Û£©Éú³ÉÊ÷ minimum(cost)spanning tree
Éú³ÉÉ­ÁÖ spanning forest

ÍØÆËÅÅÐò topological sort
Æ«Ðò partical order
ÍØÆËÓÐÐò topological order
AOVÍø activity on vertex network
AOEÍø activity on edge network
¹Ø¼ü·¾¶ critical path

Æ¥Åä matching
×î´óÆ¥Åä maximum matching
Ôö¹ã·¾¶ augmenting path
Ôö¹ã·¾¶Í¼ augmenting path graph

²éÕÒ searching
ÏßÐÔ²éÕÒ£¨Ë³Ðò²éÕÒ£©linear search (sequential search)
¶þ·Ö²éÕÒ binary search
·Ö¿é²éÕÒ block search
É¢ÁвéÕÒ hash search
ƽ¾ù²éÕÒ³¤¶È average search length

É¢Áбí hash table
É¢Áк¯Êý hash funticion
Ö±½Ó¶¨Ö··¨ immediately allocating method
Êý×Ö·ÖÎö·¨ digital analysis method
ƽ·½È¡Öз¨ mid-square method
ÕÛµþ·¨ folding method
³ý·¨ division method
Ëæ»úÊý·¨ random number method

ÅÅÐò sort
ÄÚ²¿ÅÅÐò internal sort
ÍⲿÅÅÐò external sort
²åÈëÅÅÐò insertion sort
ËæСÔöÁ¿ÅÅÐò diminishing increment sort
Ñ¡ÔñÅÅÐò selection sort
¶ÑÅÅÐò heap sort
¿ìËÙÅÅÐò quick sort
¹é²¢ÅÅÐò merge sort
»ùÊýÅÅÐò radix sort
ÍⲿÅÅÐò external sort
ƽºâ¹é²¢ÅÅÐò balance merging sort
¶þ·ƽºâ¹é²¢ÅÅÐò balance two-way merging sort
¶à²½¹é²¢ÅÅÐò ployphase merging sort
Öû»Ñ¡ÔñÅÅÐò replacement selection sort

Îļþ file
Ö÷Îļþ master file
˳ÐòÎļþ sequential file
Ë÷ÒýÎļþ indexed file
Ë÷Òý˳ÐòÎļþ indexed sequential file
Ë÷Òý·Ç˳ÐòÎļþ indexed non-sequential file
Ö±½Ó´æÈ¡Îļþ direct access file
¶àÖØÁ´±íÎļþ multilist file
µ¹ÅÅÎļþ inverted file
Ŀ¼½á¹¹ directory structure
Ê÷ÐÍË÷Òý tree index