Count odd paths in Binary Tree

Count all paths from the root node to the leaf node in a given binary tree that includes odd nodes. For example.

In the above example there are three paths in the tree which all contain odd nodes. Here given code implementation process.

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