C++ Q85: How to find common parent in a tree.# JobHunting - 待字闺中
c*e
1 楼
Find the nearest common parent to two given nodes in a tree.
c*e
2 楼
Nobody answers?
r*n
3 楼
Basic question.
1. with parent pointer:
-check if current node is in the set, if yes, return that node
-if not, put both nodes in a set
-traverse to their parent node, and repeat
2. without parent pointer:
-if node A is on L(or R) of the root while node B is on R(or L)=>root is the
common node
-otherwise
--if both A and B are on L of root, try root=root->L and repeat
--.......................R.........................R...........
1. with parent pointer:
-check if current node is in the set, if yes, return that node
-if not, put both nodes in a set
-traverse to their parent node, and repeat
2. without parent pointer:
-if node A is on L(or R) of the root while node B is on R(or L)=>root is the
common node
-otherwise
--if both A and B are on L of root, try root=root->L and repeat
--.......................R.........................R...........
相关阅读
烙印面试黑人3例 (转载)硅谷：老中何时可以放弃小中？你见过老印放弃小印吗？online coding test 如何练手？是说现在ICC都要on site培训吗？RSU有vested不vested一说吗？OPT extension最早可以提前一年申请？上几个面经顺求Bless找工作吹牛能吹多大？内推一家Palo Alto的startup公司CS还是要强调基础能力H1-B transfer 的问题 (转载)四个工作，从200K到140K，各个都是鸡肋，求轻拍很多公司用github做source control么？跟屎一样有偿 求 configure (Autoconf) script (转载)最后要和VP或director聊Job offer问题求助！特拉华州威尔明顿地区Java程序员职位也不能乱黑python求CCC或者CCC名单，达拉斯附近求个强生公司的内推