problem0872

README

872. Leaf-Similar Trees

题目

Consider all the leaves of a binary tree. Fromleft to right order, the values of thoseleaves 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-similarif 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.

解题思路

见程序注释

Documentation

Index

• type TreeNode

Types

type TreeNode

type TreeNode = kit.TreeNode

TreeNode definition for a binary tree node.

type TreeNode struct {
    Val int
    Left *TreeNode
    Right *TreeNode
}