Subtree of Another Tree
Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree s could also be considered as a subtree of itself
Example 1: Given tree s:
Given tree t:
Return true, because t has the same structure and node values with a subtree of s.
Example 2: Given tree s:
Given tree t:
Return false.
Note
采用前序遍历寻找。找到父节点相同时,开始检查是不是相同的树。若不是,继续查找
Code
Last updated