本文整理汇总了C++中createTree函数的典型用法代码示例。如果您正苦于以下问题：C++ createTree函数的具体用法？C++ createTree怎么用？C++ createTree使用的例子？那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了createTree函数的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: createZuPuTree
/*
*创建家族关系
*先把数据存入文件里面，然后再把通过数据在内存建立族谱树
*/
void createZuPuTree(ZuPu *zuPu) {
int i =0;
FILE *f;
char fileName[20];
/*输入成员的信息
*这里有个要求：最后的一条数据的第一个字段是-1(作为结束标志)
*/
int flag=1;
while(flag != -1)
{
scanfZuPuMember(&flag);
printf("the flag is %d\n",flag);
}
/*将成员的信息写入文件里面*/
strcpy(fileName,zuPu->name);
strcat(fileName,".txt");
f = fopen(fileName,"wb");
writeInfoToFile(f);
createTree(&zuPu->tree,0);//在内存里面构造关系树
}示例2: createTree
//! Reads attributes of the scene node.
void COctreeSceneNode::deserializeAttributes(io::IAttributes* in, io::SAttributeReadWriteOptions* options)
{
const s32 oldMinimal = MinimalPolysPerNode;
MinimalPolysPerNode = in->getAttributeAsInt("MinimalPolysPerNode");
io::path newMeshStr = in->getAttributeAsString("Mesh");
IMesh* newMesh = 0;
if (newMeshStr == "")
newMeshStr = MeshName;
IAnimatedMesh* newAnimatedMesh = SceneManager->getMesh(newMeshStr.c_str());
if (newAnimatedMesh)
newMesh = newAnimatedMesh->getMesh(0);
if (newMesh && ((MeshName != newMeshStr) || (MinimalPolysPerNode != oldMinimal)))
{
// recalculate tree
createTree(newMesh);
}
ISceneNode::deserializeAttributes(in, options);
}示例3: sortedArrayToBST
TreeNode* sortedArrayToBST(vector<int>& nums) {
if (nums.empty())
return NULL;
//if (nums)
TreeNode * root = createTree(nums, 0, nums.size()-1);
return root;
}示例4: test_searching_root_node
void test_searching_root_node(){
Tree tree = createTree(cmpInt);
int element1 =10;
ASSERT(1 == insertTreeNode(&tree,NULL,&element1));
ASSERT(1 == search(&tree,&element1));
disposeTree(&tree);
};示例5: test_deletes_the_root_from_the_tree
void test_deletes_the_root_from_the_tree(){
Tree tree = createTree(areNodesEqual);
int number = 12;
insertTreeNode(&tree, NULL, &number);
ASSERT(searchInTree(tree, &number));
ASSERT(1 == deleteFromTree(&tree, &number));
}示例6: test_removing_root_node_when_it_has_no_childs
void test_removing_root_node_when_it_has_no_childs(){
Tree tree = createTree(cmpInt);
int element1 = 10;
insertTreeNode(&tree,NULL,&element1);
ASSERT(1 == removeTreeNode(&tree,&element1));
ASSERT(0 == search(&tree,&element1));
};示例7: insertVar
//TODO 保留关键字
void insertVar(Tree rootTree, char *varName, DataType dataType, double data){
Tree tmpTree, parentTree;
Node newNode = malloc(sizeof(struct _Node));
tmpTree = parentTree = rootTree;
Tree newTree = createTree();
while(tmpTree != NULL){
parentTree = tmpTree;
if(parentTree->node == NULL){
break;
}
tmpTree = strcmp(parentTree->node->varName, varName) >= 0 ? parentTree->lchild : parentTree->rchild;
}
if(tmpTree == NULL){
if(strcmp(parentTree->node->varName, varName) >= 0){
parentTree->lchild = newTree;
}else{
parentTree->rchild = newTree;
}
newTree->node = newNode;
}else if(parentTree->node == NULL){
parentTree->node = newNode;
}
if(dataType == INT){
newNode->data.iData = (int)data;
newNode->dataType = INT;
}else{
newNode->data.dData = data;
newNode->dataType = DOUBLE;
}
strcpy(newNode->varName, varName);
}示例8: test_must_insert_root_node
void test_must_insert_root_node(){
Tree tree = createTree(compareInts);
int data = 2;
int result = insertIntoTree(&tree, NULL, &data);
ASSERT(SUCCESS == result);
disposeTree(&tree);
}示例9: main
int main()
{
int i;
int times;
//NodeType dynamicNum[] = {1, 3, 0, 3, 5, 3, 8, 1, 6, 9, 4};
// NodeType callNum[][CALL_NUM_LENGHT] =
// {
// {1, 3, 3, 3, 5, 3, 8, 1, 6, 9, 4},
// {1, 3, 3, 3, 5, 3, 8, 1, 6, 9, 7},
// {1, 3, 3, 3, 5, 3, 8, 1, 6, 8, 4},
// {1, 3, 3, 3, 5, 3, 8, 1, 6, 8, 5},
// {1, 3, 3, 3, 5, 3, 8, 1, 5, 3, 5},
// {1, 3, 3, 3, 5, 3, 8, 1, 5, 2, 5},
//
// {1, 2, 3, 3, 5, 3, 8, 1, 6, 9, 4},
// {1, 2, 4, 3, 5, 3, 8, 1, 6, 9, 7},
// {1, 5, 3, 3, 5, 3, 8, 1, 6, 8, 4},
// {1, 4, 3, 3, 5, 3, 8, 1, 6, 8, 5},
// {1, 8, 3, 3, 5, 3, 8, 1, 5, 3, 5},
// {1, 9, 3, 3, 5, 3, 8, 1, 5, 2, 5},
// };
NodeType dynamicNum[] = {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
NodeType dynamicNumC[] = {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
//times = GetTickCount();
Tree *pTree;
pTree = createTree();
for (i=0; i<TIMES_COUNT; i++)
{
BOOL ret;
incCallNum(dynamicNum, sizeof(dynamicNum));
//printfCallNumber(dynamicNum, sizeof(dynamicNum));
ret = addCallNumber(pTree, dynamicNum, sizeof(dynamicNum));
if (ret == FALSE)
printf("add node failed.\n");
}
printf("del...\n");
//getchar();
for (i=0; i<TIMES_COUNT; i++)
{
delCallNumber(pTree, dynamicNum, sizeof(dynamicNum));
//printfCallNumber(dynamicNum, sizeof(dynamicNum));
decCallNum(dynamicNum, sizeof(dynamicNum));
}
releaseTree(pTree);
pTree = NULL;
displayTree(pTree);
printf("\n");
printf("ok\n");
getchar();
return 0;
}示例10: test_removing_node_that_has_childs_should_fail
void test_removing_node_that_has_childs_should_fail(){
Tree tree = createTree(cmpInt);
int element1 = 10,element2 = 20,element3 = 30,element4 = 40;
insertTreeNode(&tree,NULL,&element1);
insertTreeNode(&tree,&element1,&element2);
ASSERT(0 == removeTreeNode(&tree,&element1));
disposeTree(&tree);
};示例11: test_insert_should_not_insert_if_child_parents_is_not_availble
void test_insert_should_not_insert_if_child_parents_is_not_availble(){
Tree tree = createTree(compareInt );
int result;
result = insertNode(&tree, NULL, &data[0]);
result = insertNode(&tree, &data[0] , &data[1]);
result = insertNode(&tree, &data[4] , &data[2]);
ASSERT(result == 0);
};示例12: test_5_insert_should_insert_a_child_to_root_node
void test_5_insert_should_insert_a_child_to_root_node(){
Iterator* iterator;
Tree tree = createTree(compareInt);
insertNode(&tree, NULL, &data[0]);
insertNode(&tree, &data[0] , &data[1]);
iterator = getChildren(&tree, &data[0]);
ASSERT(&data[1] == iterator->next(iterator));
};示例13: test_searchs_the_given_data_in_list
//------------------------------search---------------------------------------------------
void test_searchs_the_given_data_in_list(){
Tree tree = createTree(areNodesEqual);
int num1 = 1,num2=2;
insertTreeNode(&tree, NULL, &num1);
insertTreeNode(&tree, &num1, &num2);
ASSERT(searchInTree(tree, &num1));
ASSERT(searchInTree(tree, &num2));
}示例14: createTree
void Exporter::postConstructor()
{
createTree();
applyConfig();
}示例15: createTree
void createTree(int x, int l, int r)
{
node[x].l = l;
node[x].r = r;
node[x].update = 0;
if(l == r)
{
node[x].sum = num[l];
}
else
{
int mid = midium(l, r);
createTree(left(x), l, mid);
createTree(right(x), mid + 1, r);
node[x].sum = node[left(x)].sum + node[right(x)].sum;
}
}