---
title: "Discussion on \"Revamp Your Data Structures and Algorithms Journey\" | Hashnode"
description: "Discussion on \"Revamp Your Data Structures and Algorithms Journey\". 101. Symmetric Tree\nGiven the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).\nExample 1:\n\nInput: root = [1,2,2,3,4,4,3]\nOutput: true\n\nExample 2:\n\nInput: root = [1,2,2,null,3,null,3]\nOutput: false\n\nCo..."
url: "https://hashnode.com/posts/revamp-your-data-structures-and-algorithms-journey/682205ebfbcc8533a6330191"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Revamp Your Data Structures and Algorithms Journey](https://my-dsa-grind-day-3-solutions.hashnode.dev/revamp-your-data-structures-and-algorithms-journey?utm_source=hashnode&utm_medium=feed)

101\. Symmetric Tree Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: Input: root = \[1,2,2,3,4,4,3\] Output: true Example 2: Input: root = \[1,2,2,null,3,null,3\] Output: false Co...

May 12, 2025 · 3 min read · my-dsa-grind-day-3-solutions.hashnode.dev  
Read the article

## Written by

[Saivaishnav Ambati](https://hashnode.com/@AmbatiSaiVaishnav)

@AmbatiSaiVaishnav

  
[View profile](https://hashnode.com/@AmbatiSaiVaishnav)

#LearnTodayDieTomorrow

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
