2022-03-27 20:46:41 +08:00
< p > Consider all the leaves of a binary tree, from left to right order, the values of those leaves form a < strong > leaf value sequence< / strong > < em > .< / em > < / p >
< p > < img alt = "" src = "https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/16/tree.png" style = "width: 400px; height: 336px;" / > < / p >
< p > For example, in the given tree above, the leaf value sequence is < code > (6, 7, 4, 9, 8)< / code > .< / p >
< p > Two binary trees are considered < em > leaf-similar< / em > if their leaf value sequence is the same.< / p >
< p > Return < code > true< / code > if and only if the two given trees with head nodes < code > root1< / code > and < code > root2< / code > are leaf-similar.< / p >
< p > < / p >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 1:< / strong > < / p >
2022-03-27 20:46:41 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2020/09/03/leaf-similar-1.jpg" style = "width: 600px; height: 237px;" / >
< pre >
< strong > Input:< / strong > root1 = [3,5,1,6,2,9,8,null,null,7,4], root2 = [3,5,1,6,7,4,2,null,null,null,null,null,null,9,8]
< strong > Output:< / strong > true
< / pre >
2023-12-09 18:42:21 +08:00
< p > < strong class = "example" > Example 2:< / strong > < / p >
2022-03-27 20:46:41 +08:00
< img alt = "" src = "https://assets.leetcode.com/uploads/2020/09/03/leaf-similar-2.jpg" style = "width: 300px; height: 110px;" / >
< pre >
< strong > Input:< / strong > root1 = [1,2,3], root2 = [1,3,2]
< strong > Output:< / strong > false
< / pre >
< p > < / p >
< p > < strong > Constraints:< / strong > < / p >
< ul >
< li > The number of nodes in each tree will be in the range < code > [1, 200]< / code > .< / li >
< li > Both of the given trees will have values in the range < code > [0, 200]< / code > .< / li >
< / ul >
