Iterative function to check if two trees are identical

/* Iterative C# program to check if two */
using System;
using System.Collections.Generic;

class GfG 
{ 

// A Binary Tree Node 
class Node 
{ 
    public int data; 
    public Node left, right; 
} 

// Iterative method to find height of Binary Tree 
static bool areIdentical(Node root1, Node root2) 
{ 
    // Return true if both trees are empty 
    if (root1 == null && root2 == null) 
        return true; 

    // Return false if one is empty and other is not 
    if (root1 == null || root2 == null) 
        return false; 

    // Create an empty queues for 
    // simultaneous traversals 
    Queue<Node> q1 = new Queue<Node> (); 
    Queue<Node> q2 = new Queue<Node> (); 

    // Enqueue Roots of trees in respective queues 
    q1.Enqueue(root1); 
    q2.Enqueue(root2); 

    while (q1.Count != 0 && q2.Count != 0) 
    { 
        // Get front nodes and compare them 
        Node n1 = q1.Peek(); 
        Node n2 = q2.Peek(); 

        if (n1.data != n2.data) 
        return false; 

        // Remove front nodes from queues 
        q1.Dequeue(); 
        q2.Dequeue(); 

        /* Enqueue left children of both nodes */
        if (n1.left != null && n2.left != null) 
        { 
            q1.Enqueue(n1.left); 
            q2.Enqueue(n2.left); 
        } 

        // If one left child is empty and other is not 
        else if (n1.left != null || n2.left != null) 
            return false; 

        // Right child code (Similar to left child code) 
        if (n1.right != null && n2.right != null) 
        { 
            q1.Enqueue(n1.right); 
            q2.Enqueue(n2.right); 
        } 
        else if (n1.right != null || n2.right != null) 
            return false; 
    } 

    return true; 
} 

// Utility function to create a new tree node 
static Node newNode(int data) 
{ 
    Node temp = new Node(); 
    temp.data = data; 
    temp.left = null; 
    temp.right = null; 
    return temp; 
} 

// Driver code 
public static void Main(String[] args) 
{ 
    Node root1 = newNode(1); 
    root1.left = newNode(2); 
    root1.right = newNode(3); 
    root1.left.left = newNode(4); 
    root1.left.right = newNode(5); 

    Node root2 = newNode(1); 
    root2.left = newNode(2); 
    root2.right = newNode(3); 
    root2.left.left = newNode(4); 
    root2.left.right = newNode(5); 

    if(areIdentical(root1, root2) == true) 
    Console.WriteLine("Yes"); 
    else
    Console.WriteLine("No"); 
} 
} 

// This code is contributed by PrinciRaj1992

// C# code to implement Iterative Postorder Traversal using
// two stacks
using System;
using System.Collections.Generic;

// A binary tree node
class Node
{
    public int data;
    public Node left, right;
    public Node(int x)
    {
        data = x;
        left = right = null;
    }
}

class IterativePostorderTraversal
{
    static bool IsIdentical(Node r1, Node r2)
    {
        Stack<Node> stack1 = new Stack<Node>();
        Stack<Node> stack2 = new Stack<Node>();

        // Loop until both trees are completely traversed
        while (r1 != null || stack1.Count > 0 || r2 != null || stack2.Count > 0)
        {
            // Push all left nodes of the first tree in stack1
            while (r1 != null)
            {
                stack1.Push(r1);
                r1 = r1.left;
            }
            // Push all left nodes of the second tree in stack2
            while (r2 != null)
            {
                stack2.Push(r2);
                r2 = r2.left;
            }
            // If the sizes of both stacks are different, trees are not identical
            if (stack1.Count != stack2.Count)
                return false;
            // Pop one node from each stack and compare their data
            r1 = stack1.Pop();
            r2 = stack2.Pop();
            if (r1.data != r2.data)
                return false;
            // Move to the right of the popped nodes
            r1 = r1.right;
            r2 = r2.right;
        }
        // Both trees are identical
        return true;
    }
// Driver code
    static void Main(string[] args)
    {
        // Construct the first tree
        Node root1 = new Node(1);
        root1.left = new Node(2);
        root1.right = new Node(3);
        root1.left.left = new Node(4);
        root1.left.right = new Node(5);

        // Construct the second tree
        Node root2 = new Node(1);
        root2.left = new Node(2);
        root2.right = new Node(3);
        root2.left.left = new Node(4);
        root2.left.right = new Node(5);

        // Check if the trees are identical
        if (IsIdentical(root1, root2))
            Console.WriteLine("Both trees are identical");
        else
            Console.WriteLine("Both trees are not identical");
    }
}