Given a binary tree, find out whether it contains a duplicate sub-tree of size two or more, or not. You don't need to read input or print anything. Your task is to complete the function dupSub() which ...
Given a binary tree, find out whether it contains a duplicate sub-tree of size two or more, or not. Note: Two same leaf nodes are not considered as subtree as size of a leaf node is one.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results