236. Lowest Common Ancestor of a Binary Tree

/*Acception!*/ class Solution { public: TreeNode * dfsTraverse(TreeNode * root, TreeNode * p , TreeNode * q) {     if( root == p || root == q || root == NULL)         return root;     TreeNode * paren
相关文章
相关标签/搜索