下面是樹類型題目需要用到的頭文件tree.h,請包含在cpp文件中編譯,而不是放在c文件中編譯,比如查找樹中兩個節點的最低公共父結點的題common_parent_in_tree.cpp,編譯它的方法是:

g++ -g common_parent_in_tree.cpp -o common_parent_in_tree

下面是tree.h的內容:

#include <stdio.h>
#include <vector>struct TreeNode{int value;std::vector<TreeNode*> vec_children;
};TreeNode* CreateTreeNode(int value){TreeNode* pNode = new TreeNode();pNode->value = value;return pNode;
}void ConnectTreeNodes(TreeNode* pParent, TreeNode* pChild){if(pParent != NULL){pParent->vec_children.push_back(pChild);}
}void PrintTreeNode(TreeNode* pNode){if(pNode != NULL){printf("value of this node is: %d\n", pNode->value);printf("its children is as the following");std::vector<TreeNode*>::iterator i = pNode->vec_children.begin();while(i < pNode->vec_children.end()){if(*i != NULL)printf("%d\t", (*i)->value);}printf("\n");}else{printf("this node is null.\n");}printf("\n");
}void PrintTree(TreeNode* pRoot){PrintTreeNode(pRoot);if(pRoot != NULL){std::vector<TreeNode*>::iterator i = pRoot->vec_children.begin();while(i < pRoot->vec_children.end()){PrintTreeNode(*i);++i;}}
}void DestroyTree(TreeNode* pRoot){if(pRoot != NULL){std::vector<TreeNode*>::iterator i = pRoot->vec_children.begin();while(i < pRoot->vec_children.end()){DestroyTree(*i);++i;}delete pRoot;}
}

總結

以上是生活随笔為你收集整理的tree类型题目需要用到的头文件tree.h的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。