树,其实也是一种链表,分为左右链表。这里还是要用到递归。下面还是以员工姓名年龄来测试,但输入 年龄为×时表示结束,此分支。
#include<iostream>
#include<stdlib.h>
using namespace std;
typedef struct _info
{
char name[10];
unsigned int age;
}Infor;
typedef struct _node
{
Infor* employee;
struct _node* father;
struct _node* l_down;
struct _node* r_down;
}Node;
typedef struct _treelist
{
Node* head;
}Treelist;
Node* create_tree(Node* father)
{
char name_temp[10];
unsigned int age_temp;
cout<<"input info:"<<endl;
cin>>name_temp>>age_temp;
if(name_temp[0] == '*')
{
return NULL;
}
else
{
Node* one_node = (Node*)malloc(sizeof(Node));
one_node->employee = (Infor*)malloc(sizeof(Infor));
one_node->father = father;
Infor* infor = one_node->employee;
strcpy(infor->name,name_temp);
infor->age = age_temp;
one_node->l_down = create_tree(one_node);
one_node->r_down = create_tree(one_node);
return one_node;
}
}
int display_node(Node* node)
{
Infor* infor = node->employee;
cout<<infor->name<<" "<<infor->age<<endl;
if(node->l_down!=NULL || node->r_down!=NULL)
{
display_node(node->l_down);
display_node(node->r_down);
}
else
{
return 0;
}
}
void display_tree_left(Treelist* tree)
{
cout>>"show all treelist:"<<endl;
display_node(tree->head);
}
int main(void)
{
Treelist* t = (Treelist*)malloc(sizeof(Treelist));
t->head = create_tree(NULL);
display_tree_left(t);
return 0;
}
运行后,有问题;
第一次运行正确:
第二次有错误:
经过检查发现,在显示函数中出现了问题,如果l_down就是NULL则接下来的cout就是不合法的,所以,在传递进函数时就判断。第一次偶然对,是有原因的,
if(node->l_down!=NULL || node->r_down!=NULL)在第一次是同时满足的,所以不会进入if执行语句。
修改如下:
int display_node(Node* node)
{
if(node != NULL)
{
Infor* infor = node->employee;
cout<<infor->name<<" "<<infor->age<<endl;
display_node(node->l_down);
display_node(node->r_down);
}
else
{
return 0;
}
}
运行结果如下,利用上面同样的输入: