Question 1: Write an algorithm to check if two binary trees are identical or not. Two binary trees are identical if they have identical structure and their contents are also the same. (Recursive sol is required) Question 2: Given a binary tree, print all cousins of a given node. Two nodes of a binary tree are cousins of each other only if they have different parents, but they are at the same level. Question 3: Calculate the height of a binary tree with leaf nodes forming a circular doubly linked list. (Here, the left pointer of leaf node will act as a previous pointer of the circular doubly linked list and its right pointer will act as the next pointer of the circular doubly linked list.)

Question 1: Write an algorithm to check if two binary trees are identical or not. Two binary trees are identical if they have identical structure and their contents are also the same. (Recursive sol is required) Question 2: Given a binary tree, print all cousins of a given node. Two nodes of a binary tree are cousins of each other only if they have different parents, but they are at the same level. Question 3: Calculate the height of a binary tree with leaf nodes forming a circular doubly linked list. (Here, the left pointer of leaf node will act as a previous pointer of circular doubly linked list and its right pointer will act as next pointer of circular doubly linked list.)