比较简练的一个寻找一个二叉树的两个节点的最近祖先结点的方法，通过数组的操作不仅快速而且代码量小，易懂。-Looking for a concise comparison of the two nodes in a binary tree node the most recent ancestor of the method, through the operation of the array is not only fast but also the amount of code is sma