登录
  • #刷题
  • #careercup

【第三轮】7.14-7.20 CareerCup 4.8

wrj5518
1417
12
4.8 You have two very large binary trees: T1, with millions of nodes, and T2, with hundreds of nodes. Create an algorithm to decide if T2 is a subtree of Tl.

A tree T2 is a subtree of Tl if there exists a node n in Tl such that the subtree of n is identical to T2. That is, if you cut off the tree at node n, the two trees would be identical.

回复解法可以按照以下格式来

[indent]
【解题思路】

【时间复杂度】

【空间复杂度】

【gist link】

---------------Optional,如果觉得test case比较好,欢迎写出来分享----------------------

【test case】


[/indent]


Notice:

1、记得在程序注释中表明自己算法的时间、空间复杂度

2、代码难懂之处加注释

3、每道题目有对应的帖子,除了贴解法,欢迎讨论,集思广益

4、任何未尽之处,欢迎回报名帖提问,我会进一步作出修改。
12条回复
热度排序

发表回复