Given a special binary tree of size **N**, whose leaf nodes are connected to form a circular doubly linked list, your task is to complete the function **findTreeHeight()**, that should return the height of the tree.

For Example:

```
1
/ \
2 3
/ \
4 5
/
6
```

In the above binary tree, 6, 5 and 3 are leaf nodes and they form 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.

**Input:**

The function a single argument as input, the reference pointer to the **root** of the binary tree.

There will be **T **test cases and for each test case the function will be called separately.

**Output:**

For each test the function should return the height of the spiral binary tree.

**Constraints:**

1<=T<=100

1<=N<=100

**Example:
Input:**

2

3

1 2 L 1 3 R 2 4 L

5

1 2 L 1 3 R 2 4 L 2 5 R 4 6 L

3

4

**Note:**The **Input/Ouput** format and **Example** given are used for system's internal purpose, and should be used by a user for **Expected Output** only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.

Author: harshitsidhwa

Anshul Wadhawan | 280 |

NoobNoob | 203 |

aild78 | 190 |

Shivam_Kumar_Singh | 183 |

stevecooper | 183 |

rambo | 868 |

Anshul Wadhawan | 740 |

Calahan | 677 |

fullmetal27 | 675 |

ks75 | 657 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3491 |

surbhi_7 | 2748 |