随笔分类 -  PAT甲级

不管做多少遍,都津津有味。
摘要:题目描述 The lowest common ancestor (LCA) of two nodes U and V in a tree is the deepest node that has both U and V as descendants.Given any two nodes in a 阅读全文
posted @ 2019-02-16 14:23 小王点点 阅读(610) 评论(0) 推荐(0)