树
尼亚3c
这个作者很懒,什么都没留下…
展开
-
浙大PAT 1020. Tree Traversals (25)
Suppose that all the keys in a binary tree are distinct positive integers. Given the postorder and inorder traversal sequences, you are supposed to output the level order traversal sequence of the cor原创 2017-03-04 23:05:29 · 215 阅读 · 0 评论 -
浙大PAT 1021. Deepest Root (25)
A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the root that results in a highest tree. Such a root原创 2017-03-05 13:55:42 · 186 阅读 · 0 评论