Given a Binary tree, your task is to check whether the Binary tree is a full binary tree or not.
First line consists of T test case. First line of every test case consists of N, denoting number of Nodes in a binary tree. Second line of every test case consists 3*N elements 2 integers and a character.
Single line output, return true if it is a full binary tree else false.
1 2 L 1 3 R 2 4 L 2 5 R
1 2 L 1 3 R 2 4 L
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.