Given two binary trees, your task is to find if both of them are identical or not .

**Input:**

The task is to complete the method which takes 2 argument, the roots r1 and r2 of the Binary Trees. The struct Node has a data part which stores the data, pointer to left child and pointer to right child.

There are multiple test cases. For each test case, this method will be called individually.

**Output:**

The function should return true if both trees are identical else false.

**Constraints:**

1 <=T<= 30

1 <=Number of nodes<= 100

1 <=Data of a node<= 1000

**Example:
Input**

2

2

1 2 L 1 3 R

2

1 2 L 1 3 R

2

1 2 L 1 3 R

2

1 3 L 1 2 R

1

0

In above example there is one test case which represent two trees with 3 nodes and 2 edges where in first test case both trees are identical having the root as 1, left child of 1 is 2 and right child of 1 is 3 where as in second test case both trees are not identical .

Author: Shubham Joshi 1

aquawaters | 7 |

SauravPandey | 6 |

hellolanguage | 6 |

aliinbox | 5 |

vjoshi345 | 4 |

kinetic | 300 |

yirans | 260 |

kevinyu102589 | 237 |

rutvik29 | 203 |

kyaba-kun | 192 |

akhayrutdinov | 4911 |

Ibrahim Nash | 4427 |

Quandray | 4260 |

sanjay05 | 3668 |

GB11 | 2857 |

Login to report an issue on this page.