BETA

Difficulty Level: Basic

Submissions: 137 Accuracy:

53.28%

[Count Non-Leaf Nodes in Tree (Function Problem)]
     

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<=103
0<=N<=103

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
Output:
1
3


 

** For More Input/Output Examples Use 'Expected Output' option **

Author: Harshit Sidhwa


					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.