for (it = children.begin(); it != children.end(); it++)
delete it->second;
- delete &children;
}
-TreeNode *TreeNode::exploreChild(tree_t id)
+TreeNode * TreeNode::exploreChild(tree_t id)
{
TreeNode *n;
std::set<tree_t >::iterator it;
int TreeNode::setBacktrack(tree_t id)
{
- if (backtrack.find(id) == backtrack.end())
+ if (backtrack.find(id) != backtrack.end())
return 1;
backtrack.insert(id);
return 0;
tree_t TreeNode::getNextBacktrack()
{
if (backtrack.empty())
- return NULL;
+ return TREE_T_NONE;
return *backtrack.begin();
}
-TreeNode *TreeNode::getRoot()
+TreeNode * TreeNode::getRoot()
{
if (parent)
return parent->getRoot();