BJFUOJ：基于二叉链表的二叉树最大宽度的计算

最新推荐文章于 2023-11-04 15:07:24 发布

侯一鸣Supermonkey

最新推荐文章于 2023-11-04 15:07:24 发布

阅读量2k

点赞数

分类专栏：数据结构与算法

本文链接：https://blog.csdn.net/qq_19830591/article/details/123438759

版权

链表 c++ 数据结构

数据结构与算法专栏收录该内容

52 篇文章 12 订阅

订阅专栏

BJFUOJ：基于二叉链表的二叉树最大宽度的计算

#include<bits/stdc++.h>
using namespace std;
int maxWide = -1;
typedef struct BiTnode{
	char data;
	int deepth;
	struct BiTnode *lchile,*rchild;
}BiTnode,*BiTree;

void CreatTree(BiTree &t,char s[],int &i,int d){
	if(s[i] == '0'){
		t = NULL;
	}else{
		t = new BiTnode;
		t->deepth = d;
		t->data = s[i];
		CreatTree(t->lchile,s,++i,d+1);
		CreatTree(t->rchild,s,++i,d+1);// 一定不能是d++
	}
}

void FindWide(BiTree &t,int wide []){
	if(t){
		wide[t->deepth]++;
		maxWide = maxWide > wide[t->deepth] ? maxWide : wide[t->deepth];
		FindWide(t->lchile,wide);
		FindWide(t->rchild,wide);
	}
}

int main(){
	while(1){
		maxWide = -1;
		char s[100];
		cin>>s;
		if(s[0] == '0') break;
		int wide[100];
		memset(wide,0,sizeof(wide));
		BiTree t;
		int i = 0;
		CreatTree(t,s,i,1);
		FindWide(t,wide);
		cout<<maxWide<<endl;
	}
	return 0;
}