C语言打印从根节点到叶节点的所有路径

最新推荐文章于 2021-11-26 21:32:43 发布

bad7code

最新推荐文章于 2021-11-26 21:32:43 发布

阅读量3k

点赞数

分类专栏：算法 C语言文章标签： c语言算法二叉树

本文链接：https://blog.csdn.net/bad7code/article/details/46443171

版权

C语言同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

算法

4 篇文章 0 订阅

订阅专栏

include<iostream>
include<list>
using namespace std;

typedef struct treeNode{
    int data;
    struct treeNode *pLeft;
    struct treeNode *pRight;
}treeNode;

void printAllPathFromRoot(treeNode *pRoot, list<treeNode *>&path){
    if(pRoot == NULL){
        return;
    }
    path.push_back(pRoot);
    if(pRoot->pLeft == NULL && pRoot->pRight == NULL){
        list<treeNode *>::iterator iter = path.begin();
        while(iter != path.end()){
            treeNode *pNode = *iter;
            printf("%d ", pNode->data);
            iter++;
        }
        printf("\n");
    }
    if(pRoot->pLeft != NULL){
        printAllPathFromRoot(pRoot->pLeft, path);
    }
    if(pRoot->pRight != NULL){
        printAllPathFromRoot(pRoot->pRight, path);
    }
    path.pop_back();
}