英语翻译常用数据结构数组 (Array) 在程序设计中,为了处理方便,把具有相同类型的若干变量按有序的形式组织起来.这
英语翻译
常用数据结构
数组 (Array)
在程序设计中,为了处理方便,把具有相同类型的若干变量按有序的形式组织起来.这些按序排列的同类数据元素的集合称为数组.在C语言中,数组属于构造数据类型.一个数组可以分解为多个数组元素,这些数组元素可以是基本数据类型或是构造类型.因此按数组元素的类型不同,数组又可分为数值数组、字符数组、指针数组、结构数组等各种类别.
栈 (Stack)
是只能在某一端插入和删除的特殊线性表.它按照后进先出的原则存储数据,先进入的数据被压入栈底,最后的数据在栈顶,需要读数据的时候从栈顶开始弹出数据（最后一个数据被第一个读出来）.
队列 (Queue)
一种特殊的线性表,它只允许在表的前端（front）进行删除操作,而在表的后端（rear）进行插入操作.进行插入操作的端称为队尾,进行删除操作的端称为队头.队列中没有元素时,称为空队列.
链表 (Linked List)
是一种物理存储单元上非连续、非顺序的存储结构,数据元素的逻辑顺序是通过链表中的指针链接次序实现的.链表由一系列结点（链表中每一个元素称为结点）组成,结点可以在运行时动态生成.每个结点包括两个部分：一个是存储数据元素的数据域,另一个是存储下一个结点地址的指针域.
树 (Tree)
是包含n（n>0）个结点的有穷集合K,且在K中定义了一个关系N,N满足 以下条件： （1）有且仅有一个结点 k0,他对于关系N来说没有前驱,称K0为树的根结点.简称为根（root）. （2）除K0外,k中的每个结点,对于关系N来说有且仅有一个前驱. （3）K中各结点,对关系N来说可以有m个后继（m>=0）.
图 (Graph)
图是由结点的有穷集合V和边的集合E组成.其中,为了与树形结构加以区别,在图结构中常常将结点称为顶点,边是顶点的有序偶对,若两个顶点之间存在一条边,就表示这两个顶点具有相邻关系.
堆 (Heap)
在计算机科学中,堆是一种特殊的树形数据结构,每个结点都有一个值.通常我们所说的堆的数据结构,是指二叉堆.堆的特点是根结点的值最小（或最大）,且根结点的两个子树也是一个堆.
散列表 (Hash)
若结构中存在关键字和K相等的记录,则必定在f(K)的存储位置上.由此,不需比较便可直接取得所查记录.称这个对应关系f为散列函数(Hash function),按这个思想建立的表为散列表.
常用数据结构
数组 (Array)
在程序设计中,为了处理方便,把具有相同类型的若干变量按有序的形式组织起来.这些按序排列的同类数据元素的集合称为数组.在C语言中,数组属于构造数据类型.一个数组可以分解为多个数组元素,这些数组元素可以是基本数据类型或是构造类型.因此按数组元素的类型不同,数组又可分为数值数组、字符数组、指针数组、结构数组等各种类别.
栈 (Stack)
是只能在某一端插入和删除的特殊线性表.它按照后进先出的原则存储数据,先进入的数据被压入栈底,最后的数据在栈顶,需要读数据的时候从栈顶开始弹出数据（最后一个数据被第一个读出来）.
队列 (Queue)
一种特殊的线性表,它只允许在表的前端（front）进行删除操作,而在表的后端（rear）进行插入操作.进行插入操作的端称为队尾,进行删除操作的端称为队头.队列中没有元素时,称为空队列.
链表 (Linked List)
是一种物理存储单元上非连续、非顺序的存储结构,数据元素的逻辑顺序是通过链表中的指针链接次序实现的.链表由一系列结点（链表中每一个元素称为结点）组成,结点可以在运行时动态生成.每个结点包括两个部分：一个是存储数据元素的数据域,另一个是存储下一个结点地址的指针域.
树 (Tree)
是包含n（n>0）个结点的有穷集合K,且在K中定义了一个关系N,N满足 以下条件： （1）有且仅有一个结点 k0,他对于关系N来说没有前驱,称K0为树的根结点.简称为根（root）. （2）除K0外,k中的每个结点,对于关系N来说有且仅有一个前驱. （3）K中各结点,对关系N来说可以有m个后继（m>=0）.
图 (Graph)
图是由结点的有穷集合V和边的集合E组成.其中,为了与树形结构加以区别,在图结构中常常将结点称为顶点,边是顶点的有序偶对,若两个顶点之间存在一条边,就表示这两个顶点具有相邻关系.
堆 (Heap)
在计算机科学中,堆是一种特殊的树形数据结构,每个结点都有一个值.通常我们所说的堆的数据结构,是指二叉堆.堆的特点是根结点的值最小（或最大）,且根结点的两个子树也是一个堆.
散列表 (Hash)
若结构中存在关键字和K相等的记录,则必定在f(K)的存储位置上.由此,不需比较便可直接取得所查记录.称这个对应关系f为散列函数(Hash function),按这个思想建立的表为散列表.
赞 罅隙懒虫 幼苗
共回答了26个问题采纳率：96.2% 举报
Common data structure
Array (Array)
In programming,to handle convenient,put some variables with the same type of organized by orderly form.These in descending order of similar data element set is called array.In C,array belong to structure the data type.An array can be decomposed for multiple array element,these array element can be basic data types or structure types.Therefore according to the type of array element is different,the array can divide again for numerical array,the string array,pointer arrays,structure array,etc all categories.
Stack the
Only in one side is the special insert and delete linear list.It according to the principle of last-in-first-out stored data,first entered data to be pressed into the stack,the final data in the stack,need to read data from the start when stack (the last data popup data by the first read out).
Queue (Queue)
A special kind of linear list,it only allows the front-end (front in the table),and delete operation in table back-end (an) were inserted into operation.On the back of the queue of inserting operations,to delete operation called the end called team head.The queue when no element,called the empty queue.
Linked List (List)
Is a physical storage unit on non-continuous,the sequence of storage structure,data elements in a logical sequence is through the list of links to realize a pointer order.By a series of node list (list each element called node) composition,nodes may at run-time dynamic generation.Each node consists of two parts:one is stored data element data fields,the other is a storage next node address pointer domain.
Tree (Tree)
Is contains n (n > 0) a node have poor set in,and in K K defines a relationship n,n meet the following conditions:(1) and only a node k0,he is no precursor to relation n k0,called for the roots of a tree node.Referred to as the root (root).(2),except the K0 outside,k every node,it has to relation N and only a precursor.(3) of each node in the K,it can have m relationship N > = (m a subsequent 0).
Figure (Graph)
Figure is set by the nodes have poor collection of V and edge of E.Among them,in order to distinguish between with tree structure in figure structure,often will node called vertex,edge is at the top of the orderly accidentally between,if two vertices,said an edge with neighboring relationship the two vertices.
Heap (Heap)
In computer science,heap is a special kind of tree data structure,each node has a value.We usually say pile of data structure,it is to point to binary pile.The feature is the root node of the minimum value (or most),and the root node tree is also a heap of two sons.
The Hash table (Hash)
If the existing in the structure of key words and K equal,it will record in f (K) storage location.Thus,do not need to compare what can be directly obtained checked records.Says the corresponding relations for Hash function (f),press the Hash are constructed on the watch for the Hash table.
累得要死
Array (Array)
In programming,to handle convenient,put some variables with the same type of organized by orderly form.These in descending order of similar data element set is called array.In C,array belong to structure the data type.An array can be decomposed for multiple array element,these array element can be basic data types or structure types.Therefore according to the type of array element is different,the array can divide again for numerical array,the string array,pointer arrays,structure array,etc all categories.
Stack the
Only in one side is the special insert and delete linear list.It according to the principle of last-in-first-out stored data,first entered data to be pressed into the stack,the final data in the stack,need to read data from the start when stack (the last data popup data by the first read out).
Queue (Queue)
A special kind of linear list,it only allows the front-end (front in the table),and delete operation in table back-end (an) were inserted into operation.On the back of the queue of inserting operations,to delete operation called the end called team head.The queue when no element,called the empty queue.
Linked List (List)
Is a physical storage unit on non-continuous,the sequence of storage structure,data elements in a logical sequence is through the list of links to realize a pointer order.By a series of node list (list each element called node) composition,nodes may at run-time dynamic generation.Each node consists of two parts:one is stored data element data fields,the other is a storage next node address pointer domain.
Tree (Tree)
Is contains n (n > 0) a node have poor set in,and in K K defines a relationship n,n meet the following conditions:(1) and only a node k0,he is no precursor to relation n k0,called for the roots of a tree node.Referred to as the root (root).(2),except the K0 outside,k every node,it has to relation N and only a precursor.(3) of each node in the K,it can have m relationship N > = (m a subsequent 0).
Figure (Graph)
Figure is set by the nodes have poor collection of V and edge of E.Among them,in order to distinguish between with tree structure in figure structure,often will node called vertex,edge is at the top of the orderly accidentally between,if two vertices,said an edge with neighboring relationship the two vertices.
Heap (Heap)
In computer science,heap is a special kind of tree data structure,each node has a value.We usually say pile of data structure,it is to point to binary pile.The feature is the root node of the minimum value (or most),and the root node tree is also a heap of two sons.
The Hash table (Hash)
If the existing in the structure of key words and K equal,it will record in f (K) storage location.Thus,do not need to compare what can be directly obtained checked records.Says the corresponding relations for Hash function (f),press the Hash are constructed on the watch for the Hash table.
累得要死
1年前 追问
10
可能相似的问题
你能帮帮他们吗