Check if two binary trees are identical (Algorithm/code/program)

Показать описание

Given two binary trees, write a program to check whether they are identical.

Рекомендации по теме

Комментарии

Oh my word you are very good at explaining things. Nice teaching style, very clear.

marcelagomez

You are really crisp at your knowledge Thank you so much sir!!!

deepak-lvvn

Just to add how check function can be applied under boolean condition since, check function is returning int. Either check need to return boolean then it will work perfectly fine.

amreshkumar

Alternative method :-
bool check ( node* p1, node *p2 )
{
if( p1 ==NULL && p2 ==NULL )
return true;

if( p1 !=NULL && p2 !=NULL )
return ( check ( p1 -> left, p2 -> left ) && check ( p1 -> right, p2 -> right ) );
return false ;
}

harshvijeta

amazing! keep this simple and understandable explanation

FELIPESILVA-ppmr

sir ..u r doing gr8 job job on making videos on ds n keep more videos on ds n

milimishra

Good explanation, but if you specify the time and space complexity for every problem it will be more helpful

karthikeyanselvarajan

thank you for uploading video on algorithm, great job sir, nice explanation, keep adding more video.

travelogue

perfect! The way I was writing it took way longer.

ZirJohn

Thank you, your videos are very helpful for me!

kingdavey

I am thinking another way that, we can do by using level order traversal for the both the tree and in the end check both the string equal or not. if it equal the tree is identical.

amreshkumar

how to write algorithm for adding of two tree and to form one bst ??

thinkdifferent

Hi Vivekanand. Thank you for your video. I have one question about the true case. Can there also be a true case when the subtree has no more nodes (so p2 == null) but the main tree still has nodes remaining (p1 != null). In this case the subtree has already been found without traversing all the way down to tree 1's leaf nodes. Thank you.

anishasrivastava

Sir what is the time complexity of this algorithm

arghyamitra

good pls try to inlcude time and space complexity in the algo.!

prnk

Bro Your sequence of videos in this playlist is a mess.. please check and correct it.

SahilSharma-zznv

sir.. I kindly request you to make videos on arrays, matrices and strings wic r important and upload it soon..can u do it at the earliest??

saranyasaravanan

come on man u are a programmer at least drop your link in description

supamdeepbains

U have not mentioned the other 2 cases when:
1) p1==NULL && p2!=NULL return 0;
2)p1!=NULL && p2==NULL return 0;

nityanand_patna

Check if two binary trees are identical (Algorithm/code/program)

Check if two binary trees are identical (Iterative) | GeeksforGeeks

Check if two binary trees are identical (Algorithm/code/program)

Binary Tree - 37: Check if two Binary Trees are Isomorphic

Binary tree -35: Check if Two Binary Trees have same Structure

Binary Tree in Java - 21: Check if two binary trees are identical

Check if two binary trees are identical (Algorithm/code/program)

Check if two binary trees are Isomorphic

Balanced Binary Tree - Leetcode 110 - Python

Same Tree | LeetCode 100 | Check If Two Binary Trees are Identical (Iterative & Recursive Approa...

Check if two binary trees are identical 2nd approach

Check if two trees are Mirror | GeeksforGeeks

Check If Two Binary Trees Are Mirror Or Not

Check if leaf traversal of two Binary Trees is same | GeeksforGeeks

Same Tree - Leetcode 100 - Python

Binary Tree - 63: Check if given two nodes are cousin to each other in Binary Tree

Cousins in a binary tree | Leetcode #993

Binary tree -34: Check if Two Trees are Mirror Structure to each other

L18. Check it two trees are Identical or Not | C++ | Java

Validate Binary Search Tree - Depth First Search - Leetcode 98

Binary tree - 33: Check if Two Trees are Mirror to each other

Check whether a given binary tree is perfect or not | GeeksforGeeks

Iterative method to check if two trees are mirror of each other | GeeksforGeeks

Binary Tree - 86: Check if there exists a pair for given Sum in Binary Tree

Check if removing an edge can divide a Binary Tree in two halves | GeeksforGeeks