#include?
#include?
using?namespace?std;

//?分別求出結點i的父結點，左子結點、右子結點
int?parent（int?i）?{?return?i?/?2;?}
int?left（int?i）?{?return?2?*?i;?}
int?right（int?i）?{?return?2?*?i?+?1;?}
int?main（）
{
????int?H[300];
????int?n;
????scanf（“%d“?&n）;
????for?（int?i?=?1;?i?<=?n;?i++）
????????scanf（“%d“?&H[i]）;

????for?（int?i?=?1;?i?<=?n;?i++）?{
????????printf（“node?%d:?key?=?%d?“?i?H[i]）;
????????if?（parent（i）?>=?1）
????????????printf（“parent?key?=?%d?“?H[parent（i）]）;
????????if?（left（i）?<=?n）?
????????????printf（“left?key?=?%d?“?H[left（i）]）;
????????if?（right（i）?<=?n）
????????????printf（“right?key?=?%d?“?H[right（i）]）;
????????printf（“\n“）;
????}
????return?0;
}

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件????58254178??2018-12-26?18:52??挑戰程序設計競賽2?算法和數據結構.pdf
?????目錄???????????0??2018-12-26?18:38??源碼\
?????目錄???????????0??2018-12-26?20:28??源碼\第10章\
?????文件?????????753??2018-12-26?20:28??源碼\第10章\Complete?Binary?Tree.cpp
?????文件?????????864??2018-12-26?20:29??源碼\第10章\Maximum?Heap.cpp
?????文件????????1290??2018-12-26?20:29??源碼\第10章\Priority?Queue.cpp
?????目錄???????????0??2018-12-26?20:29??源碼\第11章\
?????文件?????????258??2018-12-26?20:30??源碼\第11章\Fibonacci?Number.cpp
?????文件?????????818??2018-12-26?20:30??源碼\第11章\Longest?Common?Subsequence.cpp
?????文件?????????714??2018-12-26?20:30??源碼\第11章\Matrix?Chain?Multiplication.cpp
?????目錄???????????0??2018-12-26?20:31??源碼\第12章\
?????文件????????1091??2018-12-26?20:33??源碼\第12章\Breadth?First?Search.cpp
?????文件????????1274??2018-12-26?20:33??源碼\第12章\Connected?Components.cpp
?????文件?????????956??2018-12-26?20:32??源碼\第12章\Depth?First?Search.cpp
?????文件?????????561??2018-12-26?20:32??源碼\第12章\Graph.cpp
?????目錄???????????0??2018-12-26?20:34??源碼\第13章\
?????文件????????1563??2018-12-26?20:37??源碼\第13章\Minimum?Spanning?Tree.cpp
?????文件????????1462??2018-12-26?20:37??源碼\第13章\Single?Source?Shortest?Path?I.cpp
?????文件????????1606??2018-12-26?20:38??源碼\第13章\Single?Source?Shortest?Path?II.cpp
?????目錄???????????0??2018-12-26?20:38??源碼\第14章\
?????文件????????1448??2018-12-26?20:38??源碼\第14章\Disjoint?Set?Union?Find?Tree.cpp
?????文件????????2411??2018-12-26?20:39??源碼\第14章\Range?Search?（kD?Tree）.cpp
?????目錄???????????0??2018-12-26?20:40??源碼\第15章\
?????文件????????1445??2018-12-26?20:40??源碼\第15章\All?Pairs?Shortest?Path.cpp
?????文件????????1563??2018-12-26?20:41??源碼\第15章\Articulation?Points.cpp
?????文件????????1581??2018-12-26?20:41??源碼\第15章\Diameter?of?a?Tree.cpp
?????文件????????2250??2018-12-26?20:41??源碼\第15章\Minimum?Spanning?Tree.cpp
?????文件????????1355??2018-12-26?20:40??源碼\第15章\Topological?Sort.cpp
?????目錄???????????0??2018-12-26?19:40??源碼\第16章\
?????文件????????3194??2018-12-26?19:40??源碼\第16章\Segment?Intersections?Manhattan?Geometry.cpp
?????文件????????6965??2018-12-26?19:37??源碼\第16章\模板.cpp
............此處省略56個文件信息