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...........
相关阅读
狗狗华人十一大恶俗还可以联系之前面的公司吗？關於Salary的問題求Acxiom 职位内推这种情况可以用J1签证吗什么是印度人consulting firm啊？收到ebay recruiter的信C2C contract POSITION是不是就是ICC啊？问一个C++ delete 节点的问题onsite 完后要不要发thank you letter(加onsite简单汇报)?拿到绿卡必须要带6个月才能跳槽吗？基础OOD关于博士转硕士申请opt的问题，希望大家能帮帮我有没有大牛给比较一下mongodb和cassandra?请问 大公司给 RSU 的问题Glassdoor’s Top 25 Most Difficult Companies To Interview (a家内部沟通是不是有问题？被拒了还让面？给用C++面试的同胞提个醒Leetcode 的 ACCEPT RATE 是什么 意思？现在是印度几点啊？？