Problem Submissions Solution

Mirror Binary Tree

Difficulty: Easy

Acceptance: %

Points: 20.00

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Return 1 if mirror tree, else return 0.

Topics

Companies

Articles

Examples:

Expected Time Complexity: O(n)

Expected Auxiliary Space: O(log n) for recursive calls.

Constraints:
  • 1<= number of nodes<=2000
Companies:
Amazon Microsoft
Topics:
Tree
Locked Content
Access Restricted: Please Login to access the code editor and test cases.