相关文档

复旦大学:《数据结构与算法设计 Data Structures and Algorithm》课程英文讲义_Chapter 06 Binary search trees

6.1 Binary trees and binary search tree 6.2 Inorder, preorder, and postorder tree walk 6.3 Successor and predecessor of BST 6.4 Operations of BST: search, Minimum and maximum, constructing, deletion and insertion 6.5 Balanced search trees 6.6 AVL trees 6.7 Single and double rotation 6.8 Red-black trees 6.9 B-tree (2-3-4 tree)
团购合买资源类别:文库,文档格式:PDF,文档页数:170,文件大小:1.28MB
点击进入文档下载页(PDF格式)
点击下载(PDF格式)