How to judge the substructure of a tree by LeetCode
Editor to share with you how LeetCode to achieve the substructure of the tree, I believe that most people do not know much about it, so share this article for your reference, I hope you can learn a lot after reading this article, let's go to understand it!
Topic description
Enter two binary trees An and B to determine whether B is a substructure of A. (the convention empty tree is not a substructure of any tree)
B is the substructure of A, that is, A has the same structure and node values as B.
For example: given tree A:
three
/\
4 5
/\
1 2
Given tree B:
four
/
one
Returns true because a subtree of B and A have the same structure and node values.
0
