輸出二叉樹中所有從根結點到葉子結點的路徑

// 輸出二叉樹中所有從根結點到葉子結點的路徑.cpp : 定義控制台應用程式的進入點。#include "stdafx.h"#include <iostream>#include <vector>using namespace std;struct BTNode{char m_value;BTNode *m_left;BTNode *m_right;};//先序建立二叉樹void CreatBTree(BTNode *&root){char nValue = 0;cin >> nValue;if ('#' == nValue){return;}else{root = new BTNode();root->m_value = nValue;CreatBTree(root->m_left);CreatBTree(root->m_right);}}//輸出二叉樹中所有從根結點到葉子結點的路徑(遞迴)void FindAllPath(BTNode *pRoot, vector<char> path){if (pRoot != NULL){path.push_back(pRoot->m_value);if (pRoot->m_left == NULL && pRoot->m_right == NULL){for (vector<char>::iterator iter=path.begin(); iter!=path.end(); iter++){cout << *iter << " ";}cout << endl;return;}else{FindAllPath(pRoot->m_left, path);FindAllPath(pRoot->m_right, path);}}}int _tmain(int argc, _TCHAR* argv[]){BTNode *pRoot = NULL;vector<char> path;CreatBTree(pRoot);cout << "二叉樹中從根到葉子結點的所有路徑如下：" << endl;    FindAllPath(pRoot, path);system("pause");return 0;}

運行結果：