Count half nodes in a Binary Tree

A node which contains only one child is called half node of tree. Our goal is to count all half nodes which is exist in given binary tree. For example.

Here given code implementation process.

1) Count half nodes in a binary tree in java 2) Count half nodes in a binary tree in c++ 3) Count half nodes in a binary tree in c 4) Count half nodes in a binary tree in c# 5) Count half nodes in a binary tree in vb.net 6) Count half nodes in a binary tree in php 7) Count half nodes in a binary tree in node js 8) Count half nodes in a binary tree in python 9) Count half nodes in a binary tree in scala 10) Count half nodes in a binary tree in swift 11) Count half nodes in a binary tree in kotlin 12) Count half nodes in a binary tree in typescript 13) Count half nodes in a binary tree in ruby 14) Count half nodes in a binary tree in golang