A leaf value sequence of a binary tree is formed by collecting the values of all its leaves in left-to-right order.

For instance, in the example tree above, root = [4, 2, 7, 5, 6, 3, 8, null, null, null, null, null, null, null, 7, 9], the leaf value sequence is (5, 6, 3, 9).

Two binary trees are considered leaf-similar if they have the same leaf node value sequence.

Leaf node: A node with no children (no left and right child).

The order of leaves matters, not just the values.

Return true if and only if the two given binary trees with root nodes root1 and root2 are leaf-similar.

Example 1:

Input: 
	root1 = [7, 4, 9, 2, 5, 8, 6, null, null, 3, 1]
	root2 = [7, 4, 9, 2, 3, 1, 5, null, null, null, null, null, null, 8, 6]
Output: true 
Explanation: Both trees share the same leaf value sequence: (2, 3, 1, 8, 6).

Example 2:

Input: root1 = [1,2,5], root2 = [1,5,2]
Output: false
Explanation: Although the leaf node values are the same, the order of the leaves is different.

Constraints

Each tree will have between 1 and 200 nodes.

All node values will be within the range 0 to 200.

41. Leaf-Similar Trees