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

最新推荐文章于 2024-06-12 21:00:00 发布

桜キャンドル淵

最新推荐文章于 2024-06-12 21:00:00 发布

阅读量343

点赞数 6

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

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

版权

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

52 篇文章 1 订阅

订阅专栏

假设二叉树采用二叉链表存储结构，设计一个算法，求非空二叉树b的宽度（即具有节点数最多的那一层的结点个数）

#include <iostream>
#include <stack>
#include <queue>
typedef struct treenode{
    char data;
    struct treenode *left;
    struct treenode *right;
}treenode,*ptreenode;

ptreenode buytreenode(char x)
{
    ptreenode n=(ptreenode) malloc(sizeof (treenode));
    n->data=x;
    n->left= nullptr,n->right= nullptr;
    return n;
}
ptreenode build_tree()
{
    ptreenode root= buytreenode('A');
    root->left= buytreenode('B');
    root->right= buytreenode('C');
    root->left->left= buytreenode('D');
    root->left->right= buytreenode('E');
    root->right->left= buytreenode('F');
    root->right->right= buytreenode('G');
    root->left->left->left= buytreenode('H');
    root->left->left->right= buytreenode('I');
    return root;
}

ptreenode build_tree2()
{
    ptreenode root= buytreenode('A');
    root->left= buytreenode('B');
    root->right= buytreenode('C');
    root->left->left= buytreenode('D');
    root->left->right= buytreenode('E');
    root->right->left= buytreenode('F');
    root->right->right= buytreenode('G');
    root->left->left->left= buytreenode('H');
    root->left->left->right= buytreenode('I');
    root->left->right->left= buytreenode('J');
    root->left->right->right= buytreenode('K');
    root->right->right->left= buytreenode('L');
    root->right->right->right= buytreenode('M');
    return root;
}

void print_tree(ptreenode root) {
    std::queue<ptreenode> tmp;
    tmp.push(root);
    int s = tmp.size();
    while (!tmp.empty()) {
        ptreenode t = tmp.front();
        tmp.pop();
        s--;
        printf("%3c", t->data);
        if (t->left) tmp.push(t->left);
        if (t->right) tmp.push(t->right);
        if (s == 0) puts(""), s = tmp.size();
    }
}

int widest(ptreenode root)
{
    if(root== nullptr) { return 0; }
    std::queue<ptreenode > record;
    record.push(root);
    int width=-1,size=record.size();
    while(!record.empty())
    {
        ptreenode head=record.front();
        record.pop();
        if(head->left) record.push(head->left);
        if(head->right) record.push(head->right);
        if(--size==0)  size=record.size(),width=size>width?size:width;
    }
    return width;
}
int main() {
    ptreenode root=build_tree();
    print_tree(root);
    printf("%3d\n",widest(root));
    puts("");

    ptreenode root2=build_tree2();
    print_tree(root2);
    printf("%3d\n",widest(root2));
    return 0;
}