作业帮英文介绍《数据结构》要参加面试,谁能给我一段 用英文介绍 数据结构 内容就是描述大学里数据结构主要讲了哪些内容的,不要太
来源：学生作业帮 编辑：作业帮 分类：英语作业 时间：2024/10/06 00:47:59
英文介绍《数据结构》
要参加面试,谁能给我一段 用英文介绍 数据结构 内容就是描述大学里数据结构主要讲了哪些内容的,不要太多,200个单词左右就行了,
要参加面试,谁能给我一段 用英文介绍 数据结构 内容就是描述大学里数据结构主要讲了哪些内容的,不要太多,200个单词左右就行了,
给你一些介绍数据结构的链表,栈,队列,树,二叉树,以及图的特点和描述的英文吧,自己删除一些,写个大概：
let's get acquainted with some of the most common data structures.
//链表
Linked_List:The formal definition is "a data structure consisting of a group of nodes which together represent a sequence." Like arrays,linked lists have indexes,but are accessed by iterators.In the linked list below,the head is "12",which is where the iterator always begins.Suppose we have a linked list object called "list",then list.head = 12 and list.head.next = 99.The last node is called the tail and is always "null" (nothing there).
//栈
stack:First come,first served
//队列
Queue:The Queue data structure provides first come,first served
//树
Tree:If you've ever looked at a genealogy table,or at the chain of command in a corporation,you've seen data arranged in a tree.A tree is composed of a collection of nodes,where each node has some associated data and a set of children.A node's children are those nodes that appear immediately beneath the node itself.A node's parent is the node immediately above it.A tree's root is the single node that contains no parent.
//二叉树
Binary tree:A binary tree is a special kind of tree,one that limits each node to no more than two children.A binary search tree,or BST,is a binary tree whose nodes are arranged such that for every node n,all of the nodes in n's left subtree have a value less than n,and all nodes in n's right subtree have a value greater than n.As we discussed,in the average case BSTs offer log2 n asymptotic time for inserts,deletes,and searches.
//图
Graphs:Graphs are composed of a set of nodes and edges,just like trees,but with graphs there are no rules for the connections between nodes.With graphs there is no concept of a root node,nor is there a concept of parents and children.Rather,a graph is just a collection of interconnected nodes.
let's get acquainted with some of the most common data structures.
//链表
Linked_List:The formal definition is "a data structure consisting of a group of nodes which together represent a sequence." Like arrays,linked lists have indexes,but are accessed by iterators.In the linked list below,the head is "12",which is where the iterator always begins.Suppose we have a linked list object called "list",then list.head = 12 and list.head.next = 99.The last node is called the tail and is always "null" (nothing there).
//栈
stack:First come,first served
//队列
Queue:The Queue data structure provides first come,first served
//树
Tree:If you've ever looked at a genealogy table,or at the chain of command in a corporation,you've seen data arranged in a tree.A tree is composed of a collection of nodes,where each node has some associated data and a set of children.A node's children are those nodes that appear immediately beneath the node itself.A node's parent is the node immediately above it.A tree's root is the single node that contains no parent.
//二叉树
Binary tree:A binary tree is a special kind of tree,one that limits each node to no more than two children.A binary search tree,or BST,is a binary tree whose nodes are arranged such that for every node n,all of the nodes in n's left subtree have a value less than n,and all nodes in n's right subtree have a value greater than n.As we discussed,in the average case BSTs offer log2 n asymptotic time for inserts,deletes,and searches.
//图
Graphs:Graphs are composed of a set of nodes and edges,just like trees,but with graphs there are no rules for the connections between nodes.With graphs there is no concept of a root node,nor is there a concept of parents and children.Rather,a graph is just a collection of interconnected nodes.