树的相关题型

哈夫曼树

POJ1521

https://www.cnblogs.com/OFSHK/p/12544649.html

POJ3253

看一下题目，是一个模板题

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<queue>
using namespace std;
typedef long long ll;

int main()
{
    int n;
    while(cin>>n)
    {
        priority_queue<int,vector<int>,greater<int> >Q;
        for(int i=1; i<=n; i++)
        {
            ll x;
            cin>>x;
            Q.push(x);
        }
        ll sum=0;
        while(Q.size()>1)
        {
            ll p=Q.top();
            Q.pop();
            ll q=Q.top();
            Q.pop();
            Q.push(p+q);
            sum=sum+p+q;
        }
        cout<<sum<<endl;
    }
    return 0;
}

二叉树求先序、后序

先序：T2113计蒜客

https://www.cnblogs.com/OFSHK/p/12316879.html#_label2

后序：

HDU1710

https://www.cnblogs.com/OFSHK/p/12316879.html#_label2

POJ2255

https://www.cnblogs.com/OFSHK/p/11305259.html

判断两个序列是否能构成二叉搜索树

HDU3791

https://www.cnblogs.com/OFSHK/p/12316879.html#_label2

最小生成树

POJ1789

https://www.cnblogs.com/OFSHK/p/12714293.html