Skip to main content

Check if two binary trees are equal

Question: Write a function to test if two binary trees are equal. The trees are equal only if the values are equal and also the structures are equal.


Equal trees

      89                                89
  12      100                    12       100
2                                 2

Not equal trees
        89                                   89
   2        100                      12        100
     12                             2

First thing which comes to our mind is just write

if   nd1->val !=nd2->val, trees are not equal.

OK. That is correct. But then what? What do we compare next? Value of left child? Or value of right child?

Like all other operations of binary tree, this function also needs recursion.

After ensuring that nd1->val and nd2->val are equal, we have to call this function on left child and right child. And only if both of these calls return 1, the trees are equal.

So here are the steps
  • If nodes of two trees nd1 and nd2  are not null
    • If values of nodes are not equal return false
    • If not, 
      • l = return value of function called for left children of nd1 and nd2
      • r = return value of function for right children of nd1 and nd2
      • return l && r
  • Now if both are NULL return true
 If both nd1 and nd2 are equal, then they are leaf nodes and hence we must return true. As long as both are having same values in subtrees, l&&r will be 1 (which is true in C).

But if there is a non-matching node somewhere, then the function returns false, which is propagated up the stack.

Let us write the function.


int equal_trees(NODEPTR nd1,NODEPTR nd2)
{
    if(nd1==nd2)
       return 1;//both are null
    if(nd1!=NULL ){
      if(nd2==NULL)
         return 0;
      if(nd1->val!=nd2->val)
         return 0;
      else
         {
           int l= equal_trees(nd1->left,nd2->left);
           int r = equal_trees(nd1->right,nd2->right);
           return l&r;
         }
    }
    if(nd2!=NULL && nd1==NULL)
       return 0;
}

Labels:

Comments

Post a Comment

Popular posts from this blog

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...
Post a Comment
Read more

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Binary tree deletion

Do not get all scared and worried. It is not rocket science (or as I would like to call it - it is not regex). Remember deleting a node from linked list. When you deleted a node, you did the following 2 steps Free the memory of the node Link the previous node of the deleted node to the next node You will have to do these things in binary tree too. But the difficulty here is do you link the previous node - or parent node in tree terminology, to the left child of deleted node? Or to the right child? You can not link both children, as the parent already may have one child node. So before we solve this, let us categorize the deletion with the help of a diagram. Consider the cases The node to be deleted is a leaf node. That is, it does not have left or right child. In this case, link the parent to NULL in place of deleted node.  If you want to delete 13 - which is a leaf node, you set 14->left to NULL and free memory of node 13. If you want to delete 7 - which is also a leaf node and...
Post a Comment
Read more