//构建普通意义上的树,不知道有几个孩子节点,因此用到了一个顺序容器vector来放孩子节点,因此在树的节点中children是一个指针容器
#include<iostream>
#include<vector>
using namespace std;
struct treenode
{
int value;
vector<treenode*> children;
};
treenode* createtreenode(int data)
{
treenode* pnode=new treenode;
pnode->value=data;
return pnode;
}
void connecttreenode(treenode* parent,treenode* children)
{
if(parent!=NULL)
parent->children.push_back (children);
}
void printtreenode(treenode* pnode)
{
if(pnode!=NULL)
#include<iostream>
#include<vector>
using namespace std;
struct treenode
{
int value;
vector<treenode*> children;
};
treenode* createtreenode(int data)
{
treenode* pnode=new treenode;
pnode->value=data;
return pnode;
}
void connecttreenode(treenode* parent,treenode* children)
{
if(parent!=NULL)
parent->children.push_back (children);
}
void printtreenode(treenode* pnode)
{
if(pnode!=NULL)