Consider all the leaves of a binary tree. From left to right order, the values of those leaves form a leaf value sequence.
For example, in the given tree above, the leaf value sequence is (6, 7, 4, 9, 8).
Two binary trees are considered leaf-similar if their leaf value sequence is the same.
Return true if and only if the two given trees with head nodes root1 and root2 are leaf-similar.
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def FindSeq(self,root):
if root == None:
return []
if root.left == None and root.right == None:
return [root.val]
return self.FindSeq(root.left) + self.FindSeq(root.right)
def leafSimilar(self, root1, root2):
"""
:type root1: TreeNode
:type root2: TreeNode
:rtype: bool
"""
leafs1 = self.FindSeq(root1)
leafs2 = self.FindSeq(root2)
if leafs1 == leafs2:
return True
return False