University notes (1) data structure and algorithm

1. Recursive calculation time is very long because there are a lot of repeated calculations.
2. Logical structure: set, linear, tree, graph (network)
physical structure (storage structure): sequential storage, chain, index, hash
3 , The calculation is limited, the program is not necessarily, such as the operating system
4. Algorithm characteristics: finiteness , determinism, feasibility, input and output
algorithm requirements: correctness, readability, robustness, efficiency, storage capacity (memory )
5. Binary tree cannot be determined by only one traversal
. In-order + pre-order or post-order can determine the binary tree.
Pre-order + post-order may or may not determine the binary tree