題目介紹：

M*N的座標方格（左下點座標（0，0），右上點座標（M,N），自己在圖紙上畫下），輸出從（0，0）點到（M，N）點的所有路徑（規則：只能向右和向上走）

程式原始碼：

// C++程式  二叉樹結構

#include <IOSTREAM>
#include <MALLOC.H>
#include <VECTOR>
using namespace std;


#define M 5
#define N 5


struct nodeData
{
int x;
int y;
};


struct CTreeNode
{
    CTreeNode *lChild;
CTreeNode *rChild;
    nodeData mData;
};
CTreeNode *createTree(CTreeNode *pNode,int x,int y);
void findAllPath(CTreeNode *pRoot, vector<int> xpath,vector<int> ypath);
int main()
{
CTreeNode *rootNode;
rootNode = NULL;
rootNode = createTree(rootNode,0,0);
vector<int> xPath;
vector<int> yPath;
findAllPath(rootNode,xPath,yPath);
system("pause");  
return 0;
}
CTreeNode *createTree(CTreeNode *pNode,int x,int y)
{
if(x==M&&y==N)
{
pNode = NULL;
}
if(x<M||y<N)
{
pNode = (CTreeNode *)malloc(sizeof(CTreeNode));
pNode->lChild = NULL;
pNode->rChild = NULL;
pNode->mData.x = x;
pNode->mData.y = y;
if(x<M)
 pNode->lChild = createTree(pNode->lChild,x+1,y);
if(y<N)
 pNode->rChild = createTree(pNode->rChild,x,y+1);
}
return pNode;
}
void findAllPath(CTreeNode *pRoot, vector<int> xPath, vector<int> yPath)  
{  
    if (pRoot != NULL)  
    {  
        xPath.push_back(pRoot->mData.x);  
yPath.push_back(pRoot->mData.y);

        if (pRoot->lChild == NULL && pRoot->rChild == NULL)  
        { 
vector<int>::iterator iterx=xPath.begin();
vector<int>::iterator itery=yPath.begin();
            for (; iterx!=xPath.end(); iterx++,itery++)  
            {  
                cout<<"("<<*iterx<<","<<*itery<<") ";  
            }  
            cout << endl;
            return;  
        }  
        else  
        {  
            findAllPath(pRoot->lChild, xPath,yPath);  
            findAllPath(pRoot->rChild, xPath,yPath);  
        }  
    }  
}  

擴充套件：

 M*N的座標方格，有對角線，輸出從（0，0）點到（M，N)點的所有路徑（規則：只能向上，向右，向斜右上方向）

程式原始碼

//C++ 三叉樹結構

#include <IOSTREAM>
#include <MALLOC.H>
#include <VECTOR>
using namespace std;


#define M 5
#define N 5


struct nodeData
{
int x;
int y;
};


struct CTreeNode
{
    CTreeNode *lChild;
CTreeNode *mChild;
CTreeNode *rChild;
    nodeData mData;
};
CTreeNode *createTree(CTreeNode *pNode,int x,int y);
void findAllPath(CTreeNode *pRoot, vector<int> xpath,vector<int> ypath);
int main()
{
CTreeNode *rootNode;
rootNode = NULL;
rootNode = createTree(rootNode,0,0);
vector<int> xPath;
vector<int> yPath;
findAllPath(rootNode,xPath,yPath);
system("pause");  
return 0;
}
CTreeNode *createTree(CTreeNode *pNode,int x,int y)
{
if(x==M&&y==N)
{
pNode = NULL;
}
if(x<M||y<N)
{
pNode = (CTreeNode *)malloc(sizeof(CTreeNode));
pNode->lChild = NULL;
pNode->mChild = NULL;
pNode->rChild = NULL;
pNode->mData.x = x;
pNode->mData.y = y;
if(x<M)
 pNode->lChild = createTree(pNode->lChild,x+1,y);
if(x<M&&y<N)
 pNode->mChild = createTree(pNode->mChild,x+1,y+1);
if(y<N)
 pNode->rChild = createTree(pNode->rChild,x,y+1);
}
return pNode;
}
void findAllPath(CTreeNode *pRoot, vector<int> xPath, vector<int> yPath)  
{  
    if (pRoot != NULL)  
    {  
        xPath.push_back(pRoot->mData.x);  
yPath.push_back(pRoot->mData.y);

        if (pRoot->lChild == NULL && pRoot->rChild == NULL && pRoot->mChild == NULL)  
        { 
vector<int>::iterator iterx=xPath.begin();
vector<int>::iterator itery=yPath.begin();
            for (; iterx!=xPath.end(); iterx++,itery++)  
            {  
                cout<<"("<<*iterx<<","<<*itery<<") ";  
            }  
            cout << endl;
            return;  
        }  
        else  
        {  
            findAllPath(pRoot->lChild, xPath,yPath); 
findAllPath(pRoot->mChild, xPath,yPath);
            findAllPath(pRoot->rChild, xPath,yPath);  
        }  
    }  
}