Given a Binary Tree of size **N**, your task is to complete the function **countNonLeafNodes()**, that should return the count of all the non-leaf nodes of the given binary tree.

Example:

```
Input :
Output :
2
```

**Input:**

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

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

**Output:**

The function should return the count of all the non-leaf nodes of the binary tree.

**Constraints:**

1<=T<=10^{3}

0<=N<=10^{3}

**Example:
Input:**

2

2

1 2 L 1 3 R

5

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

1

3

Author: harshitsidhwa

Anshul Wadhawan | 219 |

teraGhata | 178 |

stevecooper | 161 |

ks75 | 158 |

aild78 | 156 |

rambo | 868 |

Anshul Wadhawan | 679 |

fullmetal27 | 675 |

Calahan | 665 |

ks75 | 657 |

akhayrutdinov | 4698 |

Ibrahim Nash | 3664 |

sanjay05 | 3633 |

Quandray | 3491 |

surbhi_7 | 2748 |