本文整理汇总了C++中preOrder函数的典型用法代码示例。如果您正苦于以下问题:C++ preOrder函数的具体用法?C++ preOrder怎么用?C++ preOrder使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了preOrder函数的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。
示例1: preOrder
void Tree::preOrder(Node *node) {
if (node) {
preOrder(node->left());
this->visit(node);
preOrder(node->right());
}
}
开发者ID:caiocsn,项目名称:Projeto_p2,代码行数:7,代码来源:tree.cpp
示例2: preOrder
void preOrder(node *root) {
if(root == NULL) return;
printf("%d\t", root->key);
preOrder(root->left);
preOrder(root->right);
}
开发者ID:sspark1973,项目名称:C-Prog,代码行数:7,代码来源:presuc.c
示例3: preOrder
void BTree::preOrder(tree *temp){
if(temp!=NULL){
cout<<temp->data<<" ";
preOrder(temp->left);
preOrder(temp->right);
}
}
开发者ID:xiangdong1987,项目名称:LearnC-,代码行数:7,代码来源:Tree.cpp
示例4: preOrder
void preOrder(BSTree *myTree) {
if (myTree) {
printf(" %d", myTree -> value);
preOrder(myTree -> leftChild);
preOrder(myTree -> rightChild);
}
}
开发者ID:rodrigoalvesvieira,项目名称:competitive-programming,代码行数:7,代码来源:binary-search-tree-1195.cpp
示例5: preOrder
void preOrder(node* ptr){
if(ptr!=NULL){
printf("%d ",ptr->data);
preOrder(ptr->left);
preOrder(ptr->right);
}
}
开发者ID:netzanava05,项目名称:netnaja,代码行数:7,代码来源:AVL.c
示例6: preOrder
void preOrder(node* root)
{
if(root == NULL)
return ;
printf("%s %d %d\n" , root->key , root->ht , getBalance(root)) ;
preOrder(root->lc) ;
preOrder(root->rc) ;
}
开发者ID:akshit96,项目名称:basicDataStructures,代码行数:8,代码来源:AVL_Trees.c
示例7: preOrder
void preOrder(struct TNode* root)
{
if (root == NULL)
return ;
printf("%d ", root->data);
preOrder(root->left);
preOrder(root->right);
}
开发者ID:srinivas-github,项目名称:DataStructures,代码行数:8,代码来源:SortedArrayToBST.cpp
示例8: preOrder
static void preOrder(RBTree rootNode) {
if(rootNode)
{
printf("%d(%s) ",rootNode->key,(rootNode->color == RED?"红":"黑"));
preOrder(rootNode->lchild);
preOrder(rootNode->rchild);
}
}
开发者ID:SeaHub,项目名称:RedBlackTree,代码行数:8,代码来源:RBTree_print.cpp
示例9: preOrder
void preOrder(BINTREENODE *root)
{
if (root != NULL) {
printf("%c ", root->data);
preOrder(root->left);
preOrder(root->right);
}
}
开发者ID:aaa1616,项目名称:Fairy,代码行数:8,代码来源:graph.c
示例10: preOrder
void BinarySearchTree<T>::preOrder(Node<T> *rootTree) const
{
if (rootTree != nullptr) {
std::cout << rootTree->data << " ";
preOrder(rootTree->leftChild);
preOrder(rootTree->rightChild);
}
}
开发者ID:stelro,项目名称:stel_data_structures_and_algorithms,代码行数:8,代码来源:btree.cpp
示例11: preOrder
void preOrder(struct node *root){
if(root == NULL)
return;
printf("%d ", root->data);
preOrder(root->lptr);
preOrder(root->rptr);
}
开发者ID:nayana8,项目名称:AvlTree,代码行数:8,代码来源:avl_add.c
示例12: preOrder
void preOrder(PTreeNode pNode)
{
if (pNode != NULL) {
visit(pNode);
preOrder(pNode->left);
preOrder(pNode->right);
}
}
开发者ID:ArnaudCourbiere,项目名称:DataStructures,代码行数:8,代码来源:bestTree.c
示例13: preOrder
void TwoThreeTree::preOrder(TNode *r) {
if (r == NULL) return;
r->print();
preOrder(r->left);
preOrder(r->middle);
preOrder(r->right);
}
开发者ID:xiayan,项目名称:data_structures,代码行数:8,代码来源:TwoThreeTree.cpp
示例14: preOrder
void preOrder(TNODE *node) {
if (node == NULL) {
return;
}
printf("%d ", node->value);
preOrder(node->leftChild);
preOrder(node->rightChild);
}
开发者ID:phil0s0pher,项目名称:Lab6,代码行数:8,代码来源:functions.c
示例15: preOrder
/* A utility function to print preorder traversal of BST */
void preOrder(struct Node* node)
{
if (node == NULL)
return;
printf("%d ", node->data);
preOrder(node->prev);
preOrder(node->next);
}
开发者ID:codechikbhoka,项目名称:codes,代码行数:9,代码来源:DoublyTObst.cpp
示例16: preOrder
void preOrder(struct node *n) {
if (n == NULL)
return;
printf("%d ", n->key);
preOrder(n->left);
preOrder(n->right);
}
开发者ID:salman-bhai,项目名称:DA_A_DS,代码行数:8,代码来源:AVLTree.c
示例17: preOrder
//先序递归遍历二叉树
void preOrder(BiTree root)
{
if(root){
printf("%c ",root->data);
preOrder(root->lchild);
preOrder(root->rchild);
}
}
开发者ID:Hexing13,项目名称:shujujiegou,代码行数:9,代码来源:erchashu.c
示例18: preOrder
/*** 前序遍历***/
void preOrder(BitTree* T)
{
if(T){ //不要忘记判断 T
printf("%c ", T->data);
preOrder(T->lchild);
preOrder(T->rchild);
}
}
开发者ID:wxudongCode,项目名称:C-code,代码行数:9,代码来源:BitTree.c
示例19: preOrder
/*Bianry Search Tree 前序遍历递归实现*/
void preOrder(BinaryTree btree, Status(*visit)(BinaryTree)) {
if (btree != NULL)
{
visit(btree);
preOrder(btree->lchild, visit);
preOrder(btree->rchild, visit);
}
}
开发者ID:GeekaholicLin,项目名称:code_recorder,代码行数:10,代码来源:8607-实现二叉排序树的各种算法(1).c
示例20: func
/**
* Processes the TBST in pre-order, applying the specified function at
* each Node. Defaults to print(), starting at root.
*
*
* @param func function to apply to each Node pointer along the
* traversal path.
* @param output ostream object to append the output content to
* Design this function with only a single Node pointer in mind.
* @param cur pointer to Node at which to process and start recursion on.
*/
void TBST::preOrder(void (*func)(Node*, ostream&), ostream& output, Node* cur) {
if(cur != NULL) {
func(cur, output);
if(cur->hasLeftChild())
preOrder(func, output, cur->getLeft());
if(cur->hasRightChild())
preOrder(func, output, cur->getRight());
}
}
开发者ID:jamesus95,项目名称:Cpp,代码行数:20,代码来源:tbst.cpp
注:本文中的preOrder函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论