一则经典的功能实现,二叉树重现:
知道先序(或者后序),中序(又称对称序列),重现二叉树。
算法思路:
由于二叉树具有左,右,根三元关系。只要能确定三个节点间的关系,就能递归重现二叉树;
1 在先序或者后序中获取根节点。(ps,先序在前,后序在后)
2 获取到节点后,将中序序列,一分为2,左侧为左子树集,右侧为右子树集
3 递归操作,在左侧取出左侧根根节点赋值给左节点,右侧取右子树,赋值个右节点。
下面是代码:
struct Node* find_root(NodeType*pirscan, size_t ofs ,\
NodeType* midscan )
{
if( ofs == 0 )
return NULL;
int l_size,r_size;
char * p_root = strchr(midscan,*pirscan);
assert(p_root);
l_size = p_root - midscan;
r_size = ofs - l_size -1;
printf("l_size %d r_size %d \n",l_size,r_size);
struct Node* t_node = get_node_mm();
t_node->item = *pirscan;
t_node->left = find_root(pirscan +1,l_size, midscan );
t_node->right = find_root(pirscan + l_size +1 ,r_size, midscan + l_size +1 );
return t_node;
}
测试代码:
void priscan(struct Node* root)
{
if(root == NULL)
return ;
printf("%c ",root->item);
priscan(root->left);
priscan(root->right);
}
void midscan1(struct Node* root)
{
if(root == NULL)
return ;
midscan1(root->left);
printf("%c ",root->item);
midscan1(root->right);
}
void postscan(struct Node* root)
{
if(root == NULL)
return ;
postscan(root->left);
postscan(root->right);
printf("%c ",root->item);
}
int main()
{
char pirscan[] = "abdcefg";
char midscan[] = "dbcaegf";
struct Node* root = find_root(pirscan, 7,midscan );
printf("%p \n",root);
priscan(root);
printf("\n");
midscan1(root);
printf("\n");
postscan(root);
return 0;
}
在交流中,我们互相进步。
期待你的回复,谢谢。