1. linear list: need the base pointer and the list length
sequential list: easily do search
linked list: easily delete, and insert
2. stack: need base pointer, top pointer & stacksize
application:
conversion from the decimal to octal
maze
bracket matching
expression calculation: two stacks, one for the operend, another for the operator
recursion using stack (hanoi problem)
3. queue: front and rear
4. array& matrix
use the across (orthogonal) linked list to store the sparse matrix
5. Binary Tree
Traversing the binary tree: pre order ; in order ; post order
Threaded Binary Tree
6. Tree
storage structures:
parents presentation;
child presentation;
child & brother presentation
Forrest can be converted into a equivalent tree
7. Huffman Tree, Optimized Tree, Huffman Coding
Should know its motivation. ...
remember the examples of assigning the student's grade level and transferring telegraphic text