Check Binary Tree Symmetry | Dataford Interview Questions

Determine if a binary tree is symmetric in structure (ignoring node values).

Asked in the DSA stage.

Represent each node as { "value": any, "left": node-or-null, "right": node-or-null }. Return True when the left and right subtrees have matching structure as mirror images, regardless of their stored values. Return False otherwise.

Constraints

The tree contains at most 1,000 nodes.
Each non-null node has value, left, and right fields.
The value field may differ between mirrored nodes and must be ignored.

Function Signature

def is_symmetric(root):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

Problem

Determine if a binary tree is symmetric in structure (ignoring node values).

Asked in the DSA stage.

Constraints

The tree contains at most 1,000 nodes.
Each non-null node has value, left, and right fields.
The value field may differ between mirrored nodes and must be ignored.

Function Signature

def is_symmetric(root):

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.