Construction of Multimedia Assisted Legal Classroom Teaching Model Based on Data Mining Algorithm

Table 2

Comparison of B-tree and B+ tree.

Indexes	B-tree	B+ tree
Difference	A leaf node does not contain any information and does not point to its sibling node	All leaf nodes contain the information of all keywords and pointers to the records containing these keywords, and the leaf nodes themselves are linked in order of the size of the keywords from small to large
Advantage	The efficiency of interpartition query is high, the space utilization is high, and the average time is small	The whole index tree structure has few layers and stable performance
Inferiority	The search range is limited	There is an additional burden of insertion and deletion, and the space utilization is low