Tree-based node insertion method and memory device

摘要

A tree-based node insertion method and a memory device are disclosed in embodiments of the present invention. The tree-based node insertion method includes: according to the key value of a node to be inserted, searching in a primary tree for the nearest node whose key value is smaller than and the most approximate to the key value of the node to be inserted; judging whether the current secondary tree is full, and if so, selecting a node from the current secondary tree as a split node, transferring all the nodes on the right of the split node in the current secondary tree to the new secondary tree, and if not, inserting the node to be inserted into the current secondary tree.