LeetCode C++ 236. Lowest Common Ancestor of a Binary Tree【Tree】中等
Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree.
According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as de
原创
2020-07-09 17:03:16 ·
228 阅读 ·
0 评论