PTA 7-14 电话聊天狂人 二叉搜索树

4
13005711862 13588625832
13505711862 13088625832
13588625832 18087925832
15005713862 13588625832

13588625832 3

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
struct node{
	ll num;
	int time;
	struct node *lc,*rc;
};
void Insert(node *&root,ll num)
{
	node *p = new node;
	p->lc = NULL;
	p->rc = NULL;
	p->num = num;
	p->time = 1; 
	if(root==NULL)
	{
		root = p;
		return ;	
	}
	
    node *T = root;
    node *LT = NULL;
    while(T)
    {
    	if(num>T->num)
    	{
    		LT = T;
    		T = T->rc;
		}else if(num<T->num)
		{
			LT = T;
			T = T->lc;
		}else if(num == T->num)
	    {
	    	T->time++;
	    	return ;
		}
	}
	if(num>LT->num)LT->rc = p;
	else LT ->lc = p;
	return ;  
}
void Print(node *root,ll num,int time)
{
	node *t = root;
	int nn=1;
	queue<node*> q; q.push(root);
	while(!q.empty())
	{
		t = q.front();
		q.pop();
		if(t->lc)q.push(t->lc);
		if(t->rc)q.push(t->rc);
		
		if(time<t->time)
		{
			nn=1;
			time = t->time;
			num = t->num;
		}else if(time==t->time)
		{
			nn++;
			if(num>t->num)
			{
				num = t->num;
			}
		}
	}
	printf("%lld %d",num,time);
	if(nn!=1)
	printf(" %d\n",nn);
	else printf("\n");
}
int main()
{
	int n;
	scanf("%d",&n);
	n*=2;
	struct node*root=NULL;
	while(n--)
	{
		ll num;
		scanf("%lld",&num);
		Insert(root,num);
	}
	Print(root,0,0);
	return 0;
}