Leaderboard
Showing:
Handle Score
@Ibrahim Nash 5725
@blackshadows 5685
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Complete Leaderboard
Duplicate subtree in Binary Tree
Medium Accuracy: 37.92% Submissions: 9136 Points: 4

Given a Binary Tree, the task is to complete the function dupSub which takes the root of the tree as the only argument and returns true if the Binary tree contains a duplicate sub-tree of size two or more.

Input :  Binary Tree 
               A
             /    \ 
           B        C
         /   \       \    
        D     E       B     
                     /  \    
                    D    E
Output : Yes

Note: Two same leaf nodes are not considered as subtree as size of a leaf node is one.

Input:
The first line of input contains an integer T denoting the no of test cases. Then T test cases follow. Each test case contains a string s representing the binary tree.
For example the string : (a(b()())(c()()) represents the below binary tree
       a
    /     \
  b       c

Output:
For each test case output will be 1 if the binary tree contains duplicate sub-tree of size two or more else 0.

Constraints:
1<=T<=50
1<=length of string<=100

Example(To be used only for expected output) :
Input:

2
(a(b(d()())(e()()))(c()(b(d()())(e()()))))
(a(b()())(c()()))

Output:
1
0


Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Duplicate subtree in Binary Tree

Output Window