文件名称:QtBtree_
介绍说明--下载内容来自于网络,使用问题请自行百度
b树的创建从空树开始构建一棵B树每次插入一个关键字不是在树中添加一个叶子结点,因为这样不再是有效的B树而是首先在最低层的某个非终端结点中添加一个关键字,若该结点的关键字个数不超过m-1,则插入完成,否则要产生结点的“分裂”(B tree created from an empty tree began to build a b tree every time insert a keyword is not a leaf node is added in the tree, because it is no longer effective b tree but first of all in one of the lowest layer of the terminal node to add a keyword, if the node number of keywords, no more than m - 1 is inserted into the finish, or to produce node \"split\")
相关搜索: 12864
(系统自动生成,下载前可以参看下载内容)
下载文件列表
QtBtree_\BTree.cpp
QtBtree_\Btree.txt
QtBtree_\InsAndDel.ui
QtBtree_\main.cpp
QtBtree_\NewBtreeDLG.ui
QtBtree_\qtbtree.cpp
QtBtree_\qtbtree.h
QtBtree_\QtBtree.pri
QtBtree_\QtBtree.pro
QtBtree_\QtBtree.pro.user
QtBtree_\qtbtree.qrc
QtBtree_\qtbtree.ui
QtBtree_
QtBtree_\Btree.txt
QtBtree_\InsAndDel.ui
QtBtree_\main.cpp
QtBtree_\NewBtreeDLG.ui
QtBtree_\qtbtree.cpp
QtBtree_\qtbtree.h
QtBtree_\QtBtree.pri
QtBtree_\QtBtree.pro
QtBtree_\QtBtree.pro.user
QtBtree_\qtbtree.qrc
QtBtree_\qtbtree.ui
QtBtree_
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.