|All-time Popular Problems|
|Delete Middle of Linked List|
|Intersection of Two Linked Lists|
|Egg Dropping Puzzle|
|Consecutive 1's not allowed|
|Element with left side smaller and right side greater|
|Merge two sorted linked lists|
|Minimum element in a sorted and rotated array|
|Root to leaf path sum|
|Minimum number of jumps|
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.
Input : Output : 2
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.
The function should return the count of all the non-leaf nodes of the binary tree.
1 2 L 1 3 R
10 20 L 10 30 R 20 40 L 20 60 R 30 90 L