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

最新推荐文章于 2024-06-19 15:06:56 发布

桜キャンドル淵

最新推荐文章于 2024-06-19 15:06:56 发布

阅读量340

点赞数 7

分类专栏：王道数据结构文章标签：数据结构算法二叉树考研 c++

本文链接：https://blog.csdn.net/weixin_62684026/article/details/136136829

版权

王道数据结构专栏收录该内容

52 篇文章 1 订阅

订阅专栏

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

#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;
}