Same Tree | JavaScript Solution Explained Step-by-Step | 100. LeetCode 101

In this video, we solve the Same Tree problem from LeetCode!

Learn how to determine if two binary trees are identical by using a recursive approach. This beginner-friendly tutorial walks you through the logic and code step by step.

📝 Problem Statement:

Given the roots of two binary trees p and q, check if they are structurally identical and have the same node values.

💡 What You’ll Learn:
• How to compare binary trees using recursion.
• The importance of base cases in recursive functions.
• Writing clean and efficient JavaScript code for binary tree problems.

🔍 Solution Highlights:
• Use recursion to check if both trees are structurally identical and have matching node values.
• Understand the base cases:
• Both nodes are null: Trees are the same.
• One node is null: Trees are not the same.
• Check left and right subtrees recursively.

📋 Examples in the Video:

1️⃣ Input: p = [1, 2, 3], q = [1, 2, 3]
Output: true

2️⃣ Input: p = [1, 2], q = [1, null, 2]
Output: false

3️⃣ Input: p = [1, 2, 1], q = [1, 1, 2]
Output: false

🚀 Why Watch?

If you’re preparing for coding interviews or learning binary tree fundamentals, this video is perfect for you. It’s a clear and concise explanation designed to boost your understanding and confidence.

🔗 Resources: