2019年11月25日
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 阅读全文
posted @ 2019-11-25 20:50 57one 阅读(135) 评论(0) 推荐(0)
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 ou 阅读全文
posted @ 2019-11-25 17:17 57one 阅读(173) 评论(0) 推荐(0)