189.Leaf-Similar Trees

题目

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.

Note:

Both of the given trees will have between 1 and 100 nodes.

链接

https://leetcode.com/problems/leaf-similar-trees/

分析

题目意思转化为找一个二叉树的自左向右的叶子节点的顺序;

code

# 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 leafSimilar(self, root1, root2):
        """
        :type root1: TreeNode
        :type root2: TreeNode
        :rtype: bool
        """
        """
        题目意思转化为找一个二叉树的自左向右的叶子节点的顺序;
        采用递归的思想做；
        (1). root 的左右节点为空，则为叶子节点加入到最后的 list 中；
        (2). 否则，遍历左右子树
        """
        return self.getLeafVal(root1) == self.getLeafVal(root2)
    
    def getLeafVal(self, root):
        """
        :type root: TreeNode
        """
        if root == None:
            return []
        re = [] ## 存放最后的结果
        if root.left == None and root.right == None:
            re.append(root.val)
        else:
            re += self.getLeafVal(root.left)
            re += self.getLeafVal(root.right)
            
        return re