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...........
相关阅读
大家找的工作保险好吗？Google onsite 穿什么好?EAD卡一般多久收到？offer请教忍痛据g请问大家关于一个小公司的面试Google面试，求内推。background check公司要收我100刀合理吗？twitter支持EB1B?/求opt挂靠。e verify 公司only人比人气死人Job Opening5/17-中国人北美甲骨文用户组IT新手入门第三讲有人了解JDSU吗？on site面试完Job-hunting 台湾实验区发展研究中心招聘海外人才目录讨论一道L的validate binary tree和求深度的问题把我H1 VISA扫描一份给小公司， 会有什么后果？？？Facebook Prices at $38 With Trading Set to Start FridayTop 100 companies for green card(Based on Q2 PERM data)