Identical Binary Trees | Dataford Interview Questions

A UST backend service receives two hierarchical configuration trees and must verify whether they represent exactly the same structure. Write a function that determines whether two binary trees are identical.

Two trees are identical when corresponding nodes contain the same value, and corresponding left and right subtrees are also identical. A missing node must match only another missing node.

Formal Specification

Implement identical_trees(root1, root2). Each tree is represented as either None or a node dictionary with this format:

{"value": integer, "left": node_or_none, "right": node_or_none}

Return True if the trees are identical, otherwise return False. The input trees may contain duplicate values, so both position and value must be checked.

Constraints

Each tree contains between 0 and 10^5 nodes
Node values are integers from -10^9 to 10^9
The trees may be highly unbalanced
Neither input tree may be modified

Function Signature

def identical_trees(root1, root2):

Your question is Identical Binary Trees. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem