本文整理汇总了C++中BinaryNode::isLeaf方法的典型用法代码示例。如果您正苦于以下问题：C++ BinaryNode::isLeaf方法的具体用法？C++ BinaryNode::isLeaf怎么用？C++ BinaryNode::isLeaf使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类BinaryNode的用法示例。
在下文中一共展示了BinaryNode::isLeaf方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: nodeCounts
long long BinaryTree::nodeCounts() {
std::queue<BinaryNode*> collections;
// Find first leaf and push it to stack
collections.push(root_);
long long count = 1;
// Iterate the cell from root to its childrens to destory
// binary tree
BinaryNode* cell = NULL;
while (!collections.empty())
{
cell = collections.front();
collections.pop();
// Push the children to stack
if (!cell->isLeaf()) {
BinaryNode *leftChild = cell->leftChild();
BinaryNode *rightChild = cell->rightChild();
if (leftChild != NULL) collections.push(leftChild);
if (rightChild != NULL) collections.push(rightChild);
}
// Count the current node
count++;
}
return count;
}示例2: deallocate
void BinaryTree::deallocate() {
std::queue<BinaryNode*> del_collections;
// Find first leaf and push it to stack
del_collections.push(root_);
BinaryNode* cell = NULL;
// Iterate the cell from root to its childrens to destory
// binary tree
while (!del_collections.empty())
{
cell = del_collections.front();
del_collections.pop();
// Push the children to stack
if (!cell->isLeaf()) {
BinaryNode *leftChild = cell->leftChild();
BinaryNode *rightChild = cell->rightChild();
if (leftChild != NULL) del_collections.push(leftChild);
if (rightChild != NULL) del_collections.push(rightChild);
}
// Delete current octree cell
delete cell;
cell = NULL;
}
this->root_ = NULL;
}