Same Word of HTML Labels

You are given the roots of two N‑ary trees, where each tree models a hierarchical label layout similar to HTML elements. Each label can have one of two configurations:

• It holds a non‑empty string value and has zero children (a leaf).
• It holds no string value (its text is empty or null) and acts purely as a container that groups one or more child labels in top‑to‑bottom order.

A leaf label is defined as any label that contains a non‑empty string and does not possess any children. Every other label is a structural grouping element; its text should be treated as empty.

Your job is to walk each tree and collect the text values of all leaf labels from top to bottom. Concatenate them in the order they are encountered within the layout.

Return true if the final concatenated strings from the two label structures are identical (same case and character sequence). Return false otherwise.

The label node is represented by the following class:

class HtmlLabel {
    String text;
    List<HtmlLabel> children;
    ...
}

Constraints

• Every leaf label carries a non‑empty string of at most 100 characters.
• The top‑to‑bottom ordering of children must be preserved when traversing.
• 0 ≤ total number of labels in either structure ≤ 10^5.

Example

Input:

> Label 1:
> <root>
>   <container>
>     <div> "He" </div>
>     <div> "llo" </div>
>   </container>
>   <p> "World" </p>
> </root>
>
> Label 2:
> <root>
>   <div> "Hello" </div>
>   <container>
>     <span> "Wor" </span>
>     <span> "ld" </span>
>   </container>
> </root>
>