树
文章平均质量分 85
ryan0wang
while (!success()) try();
展开
-
【UVA548】Tree 建树+深搜 (2/1000)
Description 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 a path原创 2017-11-26 09:48:10 · 212 阅读 · 0 评论 -
【Aizu-ALDS1_7_B】Binary Trees 树 (4/1000)
Description A rooted binary tree is a tree with a root node in which every node has at most two children. Your task is to write a program which reads a rooted binary tree T and prints the following原创 2017-11-27 15:51:25 · 267 阅读 · 0 评论