Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not. A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible.

**Input:**

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the number of edges. The next line contains the edges of the binary tree.

**Output:**

Print "Complete Binary Tree" if the tree is a complete binary tree.

Print "Not Complete Binary Tree" if the tree is not a complete binary tree.

**Constraints:**

1<=T<=100

1<=n<=100

**Example:
Input:**

3

2

1 2 L 1 3 R

3

1 2 L 2 4 L 1 3 R

1

1 3 R

Complete Binary Tree

Complete Binary Tree

Not Complete Binary Tree

Author: Ayush Govil 1

vegascrew | 179 |

ADI_MUNDI | 172 |

Deepak Rikhari | 171 |

Rajat Thakur 2 | 169 |

ground_zero | 164 |

white walker | 679 |

stevecooper | 625 |

BST | 604 |

Survivor | 552 |

chacha_vidhayak_hai_hmare | 551 |

akhayrutdinov | 4616 |

Ibrahim Nash | 3662 |

sanjay05 | 3633 |

Quandray | 3343 |

surbhi_7 | 2543 |