二叉树
文章平均质量分 80
A_Happy_ACMer
这个作者很懒,什么都没留下…
展开
-
S-Trees——根据路径求叶子节点
S-Trees A Strange Tree (S-tree) over the variable set is a binary tree representing a Boolean function . Each path of the S-tree begins at the root node and consists of n+1 nodes. Eac原创 2015-01-26 15:00:44 · 484 阅读 · 0 评论 -
Tree——二叉树中序后序建树,先序遍历
Tree You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of原创 2015-01-26 16:00:47 · 865 阅读 · 0 评论 -
Is It A Tree?——判断是否是一棵树(POJ)
Is It A Tree? Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 23262 Accepted: 7980 Description A tree is a well-known data structure that is either empty (原创 2015-02-07 15:14:32 · 687 阅读 · 0 评论