资料型态(Data.ppt

資料型態(Data Type)-程式語言的變數所能表 示的資料種類 *基本型態(Primitive Type): integer, real, boolean, character(byte) *結構化型態(Structured Type): string, array, record/structure int i, j; char c; float r; int i1[10], j1[10]; float r1[10]; i1[0]=20; i2[1]=90; … 串列(List) *有序串列可以是空的()或寫成(a1, a2, ..., an) 串列的表示法(representation of lists) *順序對應(Sequential mapping)-array *鏈結串列(Linked list)-pointer 堆疊與佇列(Stacks Queues) *堆疊是一個有序串列，所有的insertion和 deletion動作均在頂端(top)進行 *具有後進先出(LIFO-last in first out)特性 *佇列是一個有序串列，所有的insertion和 deletion是發生在串列的不同端，加入的一端 稱為尾端(rear)，刪除的一端稱為前端(front) *具有先進先出(FIFO-first in first out)特性 Representation of a stack: *a one-dimensional array: stack[0:n-1] *a variable: top *linked list *node: data, link *a variable: top Representation of a queue: *a one-dimensional array: q[0:n-1] *two variables: front rear *linked list *node: data, link * two variables: front rear Trees *A tree is a finite set of one or more nodes *樹是一個或多個節點(node)所組成的有限集合 *有一個特殊的節點稱為樹根(root) *每一個節點底下有零個或一個以上的子樹 (subtree): T1, T2, …, Tn n?0 *節點(node) *分支(branch, edge) *樹根(root) *子點(children) *父點(parent) *終端節點(leaf, terminal nodes) Trees *非終端節點(nonterminal nodes) *兄弟(siblings) *祖先(ancestor of a node): all the nodes along the path from the root to that node *分支度(degree): the number of subtrees of a node *樹的分支度(degree of a tree): the maximum degree of the nodes in the tree *階度(level): initially let the root be at level one Trees *高度(height, depth): the maximum level of any node in the tree *A forest is a set of n?0 disjoint trees *若一樹有n個nodes，則必有且唯有n-1個 edges *A graph without a cycle Representation of a Tree: *linked list *node: data, link, tag *when tag=1, data field contains a pointer to a list rather than a data item Binary Trees : *Any node can have at most two children *二元樹上每個節點的degree?2 *左子樹(left subtree) 右子樹(right subtree