题目介绍:
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 *pNod