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()()))

1

0

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

hardikJain5 | 110 |

CodeBuddy | 107 |

Akkki111 | 100 |

saurabhgrade1 | 98 |

WrongAnswer | 80 |

KshatriyaYash | 1932 |

nikhil_sojan | 1374 |

lonecoder | 1236 |

SumitSingh27 | 1103 |

mazumderrohit8 | 1095 |

blackshadows | 5327 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4566 |

Quandray | 4444 |

Login to report an issue on this page.