Solution1 递归检查
lca 一定是会让 p 和 q 分别在其两侧的
Previous0235_Lowest_Common_Ancestor_of_a_Binary_Search_TreeNext0236_Lowest_Common_Ancestor_of_a_Binary_Tree
Last updated
Was this helpful?
lca 一定是会让 p 和 q 分别在其两侧的
Last updated
Was this helpful?
Was this helpful?