Deep Compare Binary Trees | Dataford Interview Questions

Implement a function to perform a deep comparison between two binary trees and return whether they are structurally identical.

Represent each tree as a nested list [value, left, right], where an empty child is None. Return True only when both trees have the same structure and equal values at corresponding nodes. Return False otherwise.

Constraints

Each non-empty node is represented as [value, left, right].
A missing tree or child is represented by None.
0 <= number of nodes in either tree <= 1000
Node values are integers.
Corresponding values must match in addition to structure.

Function Signature

def is_same_tree(root1, root2):

Your question is Deep Compare 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

Implement a function to perform a deep comparison between two binary trees and return whether they are structurally identical.

Constraints

Each non-empty node is represented as [value, left, right].
A missing tree or child is represented by None.
0 <= number of nodes in either tree <= 1000
Node values are integers.
Corresponding values must match in addition to structure.

Function Signature

def is_same_tree(root1, root2):

Your question is Deep Compare 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.