/**
* Definition for a binary tree node.
* type TreeNode struct {
* Val int
* Left *TreeNode
* Right *TreeNode
* }
*/
func getLeaf(root *TreeNode) []int {
stack := []*TreeNode{root}
res := make([]int, 0)
for len(stack) != 0 {
cur := stack[len(stack)-1]
stack = stack[:len(stack)-1]
if cur.Right != nil {
stack = append(stack, cur.Right)
}
if cur.Left != nil {
stack = append(stack, cur.Left)
}
if cur.Left == nil && cur.Right == nil {
res = append(res, cur.Val)
}
}
return res
}
func leafSimilar(root1 *TreeNode, root2 *TreeNode) bool {
leafArr1, leafArr2 := getLeaf(root1), getLeaf(root2)
if len(leafArr1) != len(leafArr2) {
return false
}
for i := 0; i < len(leafArr1); i++ {
if leafArr1[i] != leafArr2[i] {
return false
}
}
return true
}