Description: 1. Achieve the basic operation of the sequence table, including the initialization sequence table prior to insert a new element in the i-th element, delete the i-th element, find an element, the destruction of the sequence table. Single linked list, circular linked list, doubly linked list of all basic operations. Define the order of the stack type, stack all the basic operations. The definition of the type of chain stack, all the basic operations of the stack. The application stack to achieve the number system conversion. 4 defined order queue type stack all the basic operations. Defined the chain queue type, and all the basic operations of the stack. To convert a string of plastic surgery. 5. Defined the binary list type, the establishment of a binary tree. The first sequence, sequence after sequence, levels of the binary tree traversal and output loop through the results.
To Search:
File list (Check if you may need any files):
二叉树.cpp
循环队列与链队列.cpp
栈.cpp
链表.cpp
顺序表.cpp
Download