【王道数据结构】【chapter5树与二叉树】【P185t5】

以孩子兄弟链表为存储结构,请设计递归算法求树的深度

#include <iostream>
typedef struct node{
    char data;
    struct node * pchild;
    struct node * pbrother;
}node,*pnode;

pnode buynode(char x)
{
    node* tmp=(pnode) malloc(sizeof (node));
    tmp->data=x,tmp->pchild= nullptr,tmp->pbrother= nullptr;
    return tmp;
}
//图为p190页t2的树
pnode build_tree()
{
     pnode root= buynode('A');
     root->pchild= buynode('B');
     root->pchild->pbrother= buynode('C');
     root->pbrother= buynode('D');
     root->pbrother->pchild= buynode('E');
     root->pbrother->pchild->pchild= buynode('F');
     root->pbrother->pbrother= buynode('G');
    root->pbrother->pbrother->pchild= buynode('H');
    root->pbrother->pbrother->pchild->pbrother= buynode('I');
    root->pbrother->pbrother->pchild->pbrother->pbrother= buynode('J');
    root->pbrother->pbrother->pchild->pbrother->pbrother->pchild= buynode('M');
    root->pbrother->pbrother->pchild->pbrother->pbrother->pchild->pchild= buynode('P');
    root->pbrother->pbrother->pchild->pbrother->pbrother->pchild->pbrother= buynode('N');
    root->pbrother->pbrother->pchild->pbrother->pbrother->pchild->pbrother->pbrother= buynode('O');
    root->pbrother->pbrother->pchild->pchild= buynode('K');
    root->pbrother->pbrother->pchild->pchild->pbrother= buynode('L');
    return root;
}

int depth(pnode root)
{
    if(root== nullptr) return 0;
    int ch= depth(root->pchild)+1;
    int bro= depth(root->pbrother);
    return ch>bro? ch:bro;
}
int main() {
    pnode root=build_tree();
    //图为p190页第二题的图,森林的深度为那可根节点为G的树的深度
    printf("the depth is :%3d", depth(root));
    return 0;
}

  • 7
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

桜キャンドル淵

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值