[LeetCode] Leaf-Similar Trees 叶结点相似的树
Posted grandyang
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[LeetCode] 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.
参考资料：
https://leetcode.com/problems/leaf-similar-trees/
LeetCode All in One 题目讲解汇总(持续更新中...)
以上是关于[LeetCode] Leaf-Similar Trees 叶结点相似的树的主要内容，如果未能解决你的问题，请参考以下文章
[LeetCode] 872. Leaf-Similar Trees
Leetcode_easy872. Leaf-Similar Trees
Leetcode 872. Leaf-Similar Trees
[LeetCode] Leaf-Similar Trees 叶结点相似的树