Leetcode 236 Lowest Common Ancestor of a Binary Tree

Question

碰到这个测试数据： [37,-34,-48,null,-100,-100,48,null,null,null,null,-54,null,-71,-22,null,null,null,8] 

node with value -100 

node with value -100

我的做法是 找到从根到p, q 的路径 （如有多条就保存多条路径）以数组保存， 然后找到一个index最小的存在两个数组中的值， 但是在这个测试用例下要怎么做？ 

Answer 1

liuyubobobo 2017-09-13 17:46:44

https://github.com/liuyubobobo/Play-Leetcode/blob/master/0236%20Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/cpp-Lowest-Common-Ancestor-of-a-Binary-Tree/main.cpp

供参考：）