软件测试Notes

1. Data Structures related

1. AVL Tree
2. Inorder, preorder, postorder, levelorder traversal
3. Binary Heap (Min, Max), priority queue.
   
   * Heapsort: always find the last leaf node and switch with root node. Then adjust the tree to be a min/max heap, then continue find the second last node in the array we store the values, repeat switch.

概念

1. 瀑布模型Waterfull model,
2. 周期：需求—分析/计划—设计—开发—测试—运行维护