Given a binary tree, find if it is height balanced or not.

A tree is height balanced if difference between heights of left and right subtrees is **not more than one** for all nodes of tree.

**A height balanced tree**

1

/ \

10 39

/

5

**An unbalanced tree**

1

/

10

/

5

**Input Format:**

The first line of input contains T denoting the number of testcases. T testcases follow. Each testcase contains two lines of input. The first line contains number of edges. The second line contains the connections between the nodes.

**Output Format:**

For each testcase, in a new line, print 0 or 1 accordingly.

**Your Task:**

You don't need to take input. Just complete the **function isBalanced **that takes **node **as parameter and returns **true **if the tree is balanced else returns **false**.

**Constraints:**

1 <= T <= 100

1 <= Number of nodes <= 100

0 <= Data of a node <= 1000

**Example:
Input:**

2

2

1 2 L 2 3 R

4

10 20 L 10 30 R 20 40 L 20 60 R

**Output:**

0

1

**Explanation:**

**Testcase1:**** **The tree is

1

/

2

\

3

The max difference in height of left subtree and right subtree is 2, which is greater than 1. Hence unbalanced.

**Testcase2:** The tree is

10

/ \

20 30

/ \

40 60

The max difference in height of left subtree and right subtree is 1. Hence unbalanced.

Author: kartik

lakshmi_pandey | 72 |

abbatta7 | 68 |

Ashish Kumar Vaishy | 62 |

aman19 | 58 |

Kumar Gaurav Singh | 58 |

saumitra13325 | 612 |

ashujack | 551 |

lakshmi_pandey | 544 |

aman19 | 538 |

piyushmittal25 | 514 |

blackshadows | 5249 |

akhayrutdinov | 5111 |

Ibrahim Nash | 5087 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.