Same Binary Tree

Problem

Return true if two trees have identical structures and values. Trees use complete-index arrays with nulls.

Examples

Example 1

Input: {"a":[1,2,3],"b":[1,2,3]}

Output: true

Example 2

Input: {"a":[1,2],"b":[1,3]}

Output: false

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Same Binary Tree

Return true if two trees have identical structures and values. Trees use complete-index arrays with nulls. Compare both node values and corresponding child positions. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(n+m) time; O(h) recursion stack.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.