本文整理汇总了C++中BinTree::insert方法的典型用法代码示例。如果您正苦于以下问题：C++ BinTree::insert方法的具体用法？C++ BinTree::insert怎么用？C++ BinTree::insert使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinTree的用法示例。
在下文中一共展示了BinTree::insert方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: main
int main(int argn, char *argc[])
{
int n = 1000;
unsigned int t = time(0);
int value;
if (argn > 1)
n = atoi(argc[1]);
if (argn > 2)
t = atoi(argc[2]);
srand(t);
cout << "writeBinTree " << n << " " << t << endl;
BinTree<int> tree;
BinTree<int>::Node *node;
int i;
for (i = 0; i < 30; i++)
{
do
{
value = (int) (500.0*rand()/(RAND_MAX+1.0));
node = tree.search(value);
} while (node not_eq NULL);
node = new BinTree<int>::Node (value);
tree.insert(node);
}
preOrderRec(tree.getRoot(), print_ex);
inOrderRec(tree.getRoot(), print_tex);
destroyRec(tree.getRoot());
for (i = 0; i < n; i++)
{
do
{
value = (int) (n*10.0*rand()/(RAND_MAX+1.0));
node = tree.search(value);
} while (node not_eq NULL);
node = new BinTree<int>::Node (value);
tree.insert(node);
}
preOrderRec(tree.getRoot(), print_key);
destroyRec(tree.getRoot());
}示例2: addItem
// ---------------------------------------------------------------------------
// addItem()
// Takes the Item and addes to the hash table using the movieCode as a key to
// hash function approiatly
bool Inventory::addItem(Item *item, char movieCode)
{
BinTree *storageTree = storage[hash(movieCode)];
storageTree->insert(item);
return true;
}示例3: buildTree
void buildTree(BinTree& T, ifstream& infile) {
string s;
for (;;) {
infile >> s;
cout << s << ' ';
if (s == "$$") break; // at end of one line
if (infile.eof()) break; // no more lines of data
NodeData* ptr = new NodeData(s); // NodeData constructor takes string
// would do a setData if there were more than a string
bool success = T.insert(ptr);
if (!success)
delete ptr; // duplicate case, not inserted
}
}