Teaching materials summary
Abstract data type
Abstract Data Types (Abstract Data Type, ADT) is a mathematical model of computer science data structure having a similar behavior of a particular category; or a similar semantic data type of one or more programming languages. Abstract data type is a data structure describing the theoretical tool, the purpose of which is to enable people independent of the implementation details of a program to understand the characteristics of the data structure.
Abstract data types are defined depending on its characteristics of a set of logic, while inside the computer how to represent irrelevant.
Stack
Stack (Stack), also known as the stack, which is a linear form of operation is limited. Defining a linear table insertion and deletion operations only in the trailer. This input is called the stack, relatively, and the other end is called the bottom of the stack. To insert a new element, also known as the stack into the stack, push or push, it is a new element into the top element of the above, making the new top of the stack; remove elements from one stack to stack or also known as unstack, it is the top element removed, so that the adjacent element becomes the new top of the stack.
Tree
tree is a data structure that is n (n> = 1) consisting of a finite set of nodes having a hierarchical relationship. We call it the "tree" because it looks like an upside down tree, which means that it is the root upward, downward and leaves. It has the following features: each node has zero or more child nodes; no parent node is called the root node; each non-root node has only one parent node; except root in addition, each sub-node can be divided into a plurality of disjoint sub-tree.
The tree can be defined: the root and the tree is a subtree composed of several pieces. Tree is constituted by a set and a relationship defined in the set. Elements of the collection called tree nodes, parent-child relationship definition is called relationship. Parent-child relationship between the nodes of the tree establishes a hierarchy. There is a node having a special position in this hierarchy, this node is called the root node of the tree, otherwise known as root.
Map
In computer science, a map is a collection of vertices, the vertices of the series of edge nodes (connections). Vertex represented by a circle side is the link between these circles. By connecting edges between the vertices.
Note: The vertex is also sometimes referred to as nodes or intersection, while also sometimes called a link.
问题与解决办法
单链表的插入与删除
我在做作业时发现我对于单链表的理解还是不够，还是不能用python实现单链表的各种操作，所以我到网上找到了一些资料：
单链表的基本操作
然而还是不太懂，可能在想想就行了。