华南理工大学数据结构与算法课件Chapter8 Search.pptVIP

4)Insert of B– tree 5) Delete of B– tree. (2)B+ tree 1)Definition. A 3-order B+ tree 2)Search of B+ tree Two kinds of search operations can be done on B+ tree: one is to use head pointers do sequential search starting from the smallest keyword, and the other is to use root pointer to do random search starting from root. In the search process, if the keyword of a non-leaf node is equal to the given value, the search does not end, but to continue down until the leaf nodes, the rest operation is similar to B– tree search. 4)Delete of B+ tree The delete operation of B+ tree can only be carried