LeetCode 100 | Java Solution for Same Tree Problem | Binary Tree Comparison (Hindi/English)

Achieve clarity on LeetCode Problem 100 - Same Tree with this Java-based solution tutorial! 🌳 Dive into binary tree traversal and comparison methods in Java. This guide covers recursive approaches, edge case analysis, and coding in Visual Studio Code. Essential for understanding binary trees in coding interviews and Data Structures
Topics Covered:
Introduction to Same Tree Problem
Recursive Method for Tree Comparison
Java Code Walkthrough
Practical Testing and Debugging Tips

Codes Git Link:

LeetCode 1-100 Series:
Greedy Algorithms Series:
String Algorithms Series:
Tries with Java Series:
Java Collection Classes Series:
Star Patterns Series:
Hashtags:
#LeetCode100 #JavaBinaryTree #SameTree #FAANGPreparation #BinaryTreeJava #DataStructures #CodingInHindi #LeetCodeSolutions
Tags:
DSA with Java
Data Structures and Algorithms
Java DSA course
Coding interview preparation
Crack tech interviews
Learn DSA in Java
Java programming for interviews
Early bird offer DSA
DSA course for beginners
Algorithms and data structures
Java for coding interviews
Master DSA with Java
Coding challenges Java
DSA online course
Tech interview tips
Best Java course for beginners
best dsa course for beginners
best dsa with java course
Java coding tutorials
Learn coding with Java
Data structures explained
Algorithms in Java
DSA crash course
Java bootcamp
Java interview preparation
Software engineering interviews
Top tech company interviews
DSA tutorials
Advanced Java programming
Java coding bootcamp
Competitive programming Java
Data structures roadmap
Java coding practice

[plutomessi]

class Solution {
public boolean isSameTree(TreeNode p, TreeNode q) {
ArrayList<Integer>s1= new ArrayList<>();
ArrayList<Integer>s2= new ArrayList<>();
preorder(p, s1);
preorder(q, s2);
return s1.equals(s2);
}
public void preorder(TreeNode root, ArrayList<Integer>s1){
if(root==null){

return;
}
s1.add(root.val);
preorder(root.left, s1);
preorder(root.right, s1);
}
} i did this

[plutomessi]

/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
class Solution {
public int cc = 0;
public boolean isSameTree(TreeNode p, TreeNode q) {
preorder(p, q);
return cc==0;
}
public void preorder(TreeNode p, TreeNode q){
if(cc==-1){
return;
}
if(p==null && q==null){
return;
}
if((p==null && q!=null)||(p!=null && q==null)){
cc=-1;
return;
}
int bm = p.val;
int gm = q.val;
if(bm!=gm){
cc=-1;
return;
}
preorder(p.left, q.left);
preorder(p.right, q.right);
}
} 1 more :`)