Vertical Symmetry of Binary Tree | Dataford Interview Questions

How would you check if a binary tree is vertically symmetric, meaning mirror symmetric?

Implement the check using the function below. The input is a binary tree represented by nested dictionaries with val, left, and right keys, where missing children are None; return True when the tree is its own mirror image and False otherwise.

Input and Output

root is a nested dictionary or None. Return a boolean.

Constraints

0 <= number of nodes <= 10^5
Each node contains an integer val and left and right child references
Node values may be repeated
The input tree is valid and acyclic

Function Signature

def is_symmetric(root):

Your question is Vertical Symmetry of Binary Tree. 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