ACM summary seventeen

To sum up the past few days to learn the data structure, data structure previously fragmented into contact with, but did not understand the system. A first data structure, the stack, the stack is a special end into a linear form, and only deleted. Delete and insert are referred to as the stack end at this end, and the other end is called the bottom of the stack, referred to generally inserted into the stack (stack pointer plus one), it is called to delete unstack (stack pointer minus one). And stacks of different queues, the queue removed (dequeued) at one end, inserting (enqueued) at the other end. Queue an array A [m + 1] is stored, the upper bound of the array, i.e., m is the maximum capacity of the queue. Operation needs to be set in the queue head and tail queue head pointer queue tail pointer. Queue overflow can be used to overcome the cycle team. Tree a bit difficult to understand the basic concepts or today to just write about trees. A number of sub-tree nodes of this node is referred to, the degree of the node is called a leaf node 0, 0 is not a branch is called a node, each node of the maximum value is referred to as of the tree, an upper node is called the parent node of the node lower end, the lower end of the node is called a child node of the upper node. Child node of the same parent are sibling node of the node, up to the root node is the ancestor of the node, all descendants down.