C++博客-SEMAN-最新评论http://www.cppblog.com/SEMAN/CommentsRSS.aspx曾经沧海难为水、除却巫山不是云zh-cnMon, 04 Sep 2006 06:11:00 GMTMon, 04 Sep 2006 06:11:00 GMTcnblogsre: MS的笔试题目http://www.cppblog.com/SEMAN/archive/2008/03/07/1118.html#43904521zheng521zhengFri, 07 Mar 2008 09:31:00 GMThttp://www.cppblog.com/SEMAN/archive/2008/03/07/1118.html#43904考虑一下二叉查找树的特点，如果两个节点的值都大于或都小于某一个节点的值，就继续遍历下去，否则返回节点的值
int FindLowesCommonNode(root * node , int a, int b)
{
if(a<=node.value && b<=node.value)
return FindLowesCommonNode(node->left, a,b);
if(a>=node.value && b>=node.value)
return FindLowesCommonNode(node->right, a,b);
return root.value;
}

521zheng 2008-03-07 17:31 发表评论
]]>re: GCC 参数详解http://www.cppblog.com/SEMAN/archive/2008/01/01/1440.html#40154秦歌秦歌Tue, 01 Jan 2008 05:21:00 GMThttp://www.cppblog.com/SEMAN/archive/2008/01/01/1440.html#40154

秦歌 2008-01-01 13:21 发表评论
]]>re: My Onepage English Resume[未登录]http://www.cppblog.com/SEMAN/archive/2007/08/28/868.html#31041EricEricTue, 28 Aug 2007 09:55:00 GMThttp://www.cppblog.com/SEMAN/archive/2007/08/28/868.html#31041

Eric 2007-08-28 17:55 发表评论
]]>re: 二叉树的模板实现http://www.cppblog.com/SEMAN/archive/2007/06/13/819.html#26290hellohelloWed, 13 Jun 2007 15:58:00 GMThttp://www.cppblog.com/SEMAN/archive/2007/06/13/819.html#26290

hello 2007-06-13 23:58 发表评论
]]>re: MS的笔试题目http://www.cppblog.com/SEMAN/archive/2006/12/28/1118.html#16964kghakghaThu, 28 Dec 2006 15:41:00 GMThttp://www.cppblog.com/SEMAN/archive/2006/12/28/1118.html#16964FindLowestAncestor(Struct TreeNode *pRoot, Struct TreeNode *pNode1, Struct TreeNode *pNode2)
{
if (pRoot==NULL)
return NULL;
if (pRoot==pNode1 && pRoot==pNode2)
return pRoot;
Struct TreeNode *pTemp;
if (pTemp = FindLowestAncestor(pRoot->pLeft,pNode1,pNode2))
return pTemp;
if (pTemp = FindLowestAncestor(pRoot->pRight,pNode1,pNode2))
return pTemp;
if (FindNode(pRoot,pNode1) && FindNode(pRoot,pNo
de2)) return pRoot;
return NULL;
}
struct TreeNode * FindNode（Struct TreeNode *pRoot, Struct TreeNode *pNode）
{
if(pNode在pRoot下)
{
return pRoot;
}
return NULL;
}
因为最后一步仅仅是在pRoot下是否存在pNode1和pNode2，所以还有优化的余地
上面的有点小错误，呵呵

kgha 2006-12-28 23:41 发表评论
]]>re: MS的笔试题目http://www.cppblog.com/SEMAN/archive/2006/12/28/1118.html#16963kghakghaThu, 28 Dec 2006 15:37:00 GMThttp://www.cppblog.com/SEMAN/archive/2006/12/28/1118.html#16963这样太费解了，不如写两个函数直观：
FindLowestAncestor(Struct TreeNode *pRoot, Struct TreeNode *pNode1, Struct TreeNode *pNode2)
{
if (pRoot==NULL)
return NULL;
if (pRoot==pNode1 && pRoot==pNode2)
return pRoot;
Struct TreeNode *pTemp;
if (pTemp = FindLowestAncestor(pRoot->pLeft,pNode1,pNode2))
return pTemp;
if (pTemp = FindLowestAncestor(pRoot->pRight,pNode1,pNode2))
return pTemp;
if (FindNode(pRoot,pNode1) && FindLowestAncestor(pRoot,pNo
de2)) return pRoot;
return NULL;
}
struct TreeNode * FindNode（Struct TreeNode *pRoot, Struct TreeNode *pNode）
{
if(pNode在pRoot下)
{
return pRoot;
}
return NULL;
}
因为最后一步仅仅是在pRoot下是否存在pNode1和pNode2，所以还有优化的余地

kgha 2006-12-28 23:37 发表评论
]]>re: MS的笔试题目http://www.cppblog.com/SEMAN/archive/2006/12/28/1118.html#16962kghakghaThu, 28 Dec 2006 15:23:00 GMThttp://www.cppblog.com/SEMAN/archive/2006/12/28/1118.html#16962{
if (pRoot==NULL)
return NULL;
if (pRoot==pNode1 && pRoot==pNode2)
return pRoot;
Struct TreeNode *pTemp;
if (pTemp = FindLowestAncestor(pRoot->pLeft,pNode1,pNode2))
return pTemp;
if (pTemp = FindLowestAncestor(pRoot->pRight,pNode1,pNode2))
return pTemp;
if (FindLowestAncestor(pRoot,pNode1,pNode1) && FindLowestAncestor(pRoot,pNo
de2,pNode2)) return pRoot;

return NULL;
}



kgha 2006-12-28 23:23 发表评论
]]>re: 比饶口令还饶口的复杂声明http://www.cppblog.com/SEMAN/archive/2006/12/21/907.html#16677DainDainThu, 21 Dec 2006 02:16:00 GMThttp://www.cppblog.com/SEMAN/archive/2006/12/21/907.html#16677

Dain 2006-12-21 10:16 发表评论
]]>re: 比饶口令还饶口的复杂声明http://www.cppblog.com/SEMAN/archive/2006/12/21/907.html#16675pengkunypengkunyThu, 21 Dec 2006 01:03:00 GMThttp://www.cppblog.com/SEMAN/archive/2006/12/21/907.html#16675

pengkuny 2006-12-21 09:03 发表评论
]]>re: MS的笔试题目http://www.cppblog.com/SEMAN/archive/2006/10/22/1118.html#14010小小小小Sun, 22 Oct 2006 09:18:00 GMThttp://www.cppblog.com/SEMAN/archive/2006/10/22/1118.html#14010

小小 2006-10-22 17:18 发表评论
]]>