【IT笔试面试题整理】判断一个树是否是另一个的子树

【试题描述】定义一个函数，输入判断一个树是否是另一个对的子树

You have two very large binary trees: T1, with millions of nodes, and T2, with hun-dreds of nodes Create an algorithm to decide if T2 is a subtree of T1

Note that the problem here specifies that T1 has millions of nodes—this means that we should be careful of how much space we use Let’s say, for example, T1 has 10 million nodes—this means that the data alone is about 40 mb We could create a string representing the inorder and preorder traversals If T2’s preorder traversal is a substring of T1’s preorder traversal, and T2’s inorder traversal is a substring of T1’s inorder traversal, then T2 is a sub-string of T1 We can check this using a suffix tree However, we may hit memory limitations because suffix trees are extremely memory intensive If this become an issue, we can use an alternative approach Alternative Approach: The treeMatch procedure visits each node in the small tree at most once and is called no more than once per node of the large tree Worst case runtime is at most O(n * m), where n and m are the sizes of trees T1 and T2, respectively If k is the number of occurrences of T2’s root in T1, the worst case runtime can be characterized as O(n + k * m)

【参考代码】

 1 boolean containsTree(Node t1, Node t2)
 2     {
 3         if (t2 == null)
 4             return true;
 5         else
 6             return subTree(t1, t2);
 7     }
 8
 9     boolean subTree(Node r1, Node r2)
10     {
11         if (r1 == null)
12             return false;
13         if (r1.value == r2.value)
14         {
15             if (matchTree(r1, r2))
16                 return true;
17         }
18         return (subTree(r1.left,r2) || subTree(r1.right,r2));
19     }
20
21     boolean matchTree(Node r1, Node r2)
22     {
23         if (r2 == null && r1 == null)
24             return true;
25         if (r1 == null || r2 == null)
26             return false;
27         if (r1.value != r2.value)
28             return false;
29         return (matchTree(r1.left, r2.left) && matchTree(r1.right, r2.right));
30     }

【IT笔试面试题整理】判断一个树是否是另一个的子树相关推荐

Android面试题整理（selfmade）——坚持每天回答一个
这部分面试题基本都是在2011年常见的. 发几个常见.大部分直接copy 其实好多你只要理解大致的意思就行了.解答都是偏长. 1.如何避免ANR? 答:ANR:Application Not Resp ...
【IT笔试面试题整理】二叉搜索树转换为双向链表
[试题描述] 将二叉搜索树转换为双向链表对于二叉搜索树,可以将其转换为双向链表,其中,节点的左子树指针在链表中指向前一个节点,右子树指针在链表中指向后一个节点. 思路一: 采用递归思想,对于二叉搜索 ...
网易历届笔试面试题整理大全
整理了一下网易往届笔试面试题,希望对大家有帮助: 超级有用的面试题:Java常见面试题常见算法面试题数据库常见面试题操作系统常见面试题 C/C++常见面试题大数据常见面试 ...
【IT笔试面试题整理】堆栈和队列
如何准备: Whether you are asked to implement a simple stack / queue, or you are asked to implementa modi ...
【IT笔试面试题整理】链表
如何准备 Linked list questions are extremely common These can range from simple (delete a node ina linke ...
【IT笔试面试题整理】判断链表是否存在环路，并找出回路起点
[试题描述]定义一个函数,输入一个链表,判断链表是否存在环路,并找出回路起点 Circular linked list: A (corrupt) linked list in which a node ...
【IT笔试面试题整理】给定一个数组a[N]构造数组b [N]
[来源]:腾讯2013实习生笔试给定一个数组a[N],我们希望构造数组b [N],其中b[j]=a[0]*a[1]-a[N-1] / a[j],在构造过程中,不允许使用除法:要求O(1)空间复杂 ...
【IT笔试面试题整理】给定二叉树，给每层生成一个链表
[试题描述]定义一个函数,给定二叉树,给每层生成一个链表 We can do a simple level by level traversal of the tree, with a slight ...
【IT笔试面试题整理】字符串的排列
[试题描述]输入一个字符串,打印出该字符串中字符的所有排列.例如输入字符串abc,则打印出a,b,c所能排列出来的所有字符串abc,acb,bac,bca,cab,cba. 分析:这是一道很好的考查对 ...

【IT笔试面试题整理】判断一个树是否是另一个的子树

【IT笔试面试题整理】判断一个树是否是另一个的子树相关推荐

最新文章

热门文章