u012315428的专栏

Problem F - Pre, in and post Time Limit: 1 second A common problem in data structures is to determine the traversal ofa binary tree. There are three classic ways to do it: Pre-order: You must vis

Tree Recovery  Little Valentine liked playing with binary trees very much. Her favoritegame was constructingrandomly looking binary trees with capital letters in the nodes. This is an exam

转自http://blog.youkuaiyun.com/metaphysis/article/details/7101708 // UVa Problem 122 - Trees on the level // Verdict: Accepted // Submission Date: 2011-12-25 // UVa Run Time: 0.008s // // 版权所有（C）2011，邱秋

//树的构建，遍历，计算节点数，计算叶子节点数的基本操作#include #include #include #include #include #include #include using namespace std; #define MAX_TREE_SIZE 100 typedef struct { char data; int parent; }PTNode; typ