IncredibleThings

导航

2018年10月4日 #

LeetCode - Lowest Common Ancestor of a Binary Tree

摘要： The idea is to traverse the tree starting from root. If any of the given keys (n1 and n2) matches with root, then root is LCA (assuming that both keys 阅读全文

posted @ 2018-10-04 10:56 IncredibleThings 阅读(82) 评论(0) 推荐(0)