- 博客(4)
- 资源 (10)
- 收藏
- 关注
原创 高度为n的平衡二叉树最少需要多少个节点?
设f(n)为高度为n的平衡二叉树最少含有的节点数,则:f(1) = 1;f(2) = 2; f(3) = 4;f(4) = 7;……这些可以通过画图就能得到,但是当n很大时呢?其实有如下结论:f(n) = f(n-1) + f(n-2) +1,(n>=3)。这个递推结论如何得到的呢?引导问题:求一棵二叉树的节点数目:假设一颗二叉树T,其左右子树分别为TL,TR。又假设T的节点数目为F(T),TL,TR的节点数目分别为F(TL),F(TR)。则显然:F(T) = F(TL) + F(TR) + 1。本文的问题
2010-10-04 19:09:00 13532 4
原创 POJ_2236(并查集)
<br />题目:<br />DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all computers in the network were all broken. The co
2010-10-01 10:19:00 861
原创 POJ2524(并查集)
<br />题目来源:http://poj.org/problem?id=2524<br />DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university be
2010-10-01 08:49:00 761
原创 PKU_1611(幷查集解法)
题目来源:http://poj.org/problem?id=1611采用幷查集的思路,将同一个组的的学生合并为一个集合,最后看那些学生跟student0属于同一个集合即可。下面是我的AC代码:#include"iostream"using namespace std;const int SIZE = 30001;class UFS{ public: int Parent[SIZE]; int Degree[SIZE]; void MakeSet(); int FindSet(const int&
2010-10-01 06:31:00 589
Eclipse汉化包
2014-08-16
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人