Posted on by Kalkicode
Code Binary Tree

Count complete odd nodes path of binary tree in c++

All odd nodes path from root to leaf in binary tree

C++ program for Count complete odd nodes path of binary tree. Here more solutions.

// Include header file
#include <iostream>
using namespace std;
/*
  C++ program for
  Count odd paths in Binary Tree
*/
// Binary Tree node
class TreeNode
{
	public: 
    int data;
	TreeNode *left;
	TreeNode *right;
	TreeNode(int data)
	{
		// Set node value
		this->data = data;
		this->left = nullptr;
		this->right = nullptr;
	}
};
class BinaryTree
{
	public: 
    TreeNode *root;
	BinaryTree()
	{
		this->root = nullptr;
	}
	// Count all paths from root to leaf
	// which containing all Odd nodes
	int countOddNodePath(TreeNode *node)
	{
		if (node == nullptr ||
            node->data % 2 == 0)
		{
			// When tree node is null or
			// its contain even value
			return 0;
		}
		else
		{
			if (node->left == nullptr && 
                node->right == nullptr)
			{
				// When get leaf node And
				// path contain all Odd nodes
				return 1;
			}
			return this->countOddNodePath(node->left) + 
              this->countOddNodePath(node->right);
		}
	}
};
int main()
{
	// New of binary tree
	BinaryTree *tree = new BinaryTree();
	/*
	  Construct Binary Tree
	  -----------------------
	         5
	        /  \ 
	       /    \
	      3      9
	     / \    / \
	    7   6  1   3
	   / \    / \   
	  10  3  7   4
	*/
	// Add tree node
	tree->root = new TreeNode(5);
	tree->root->left = new TreeNode(3);
	tree->root->right = new TreeNode(9);
	tree->root->right->right = new TreeNode(3);
	tree->root->left->right = new TreeNode(6);
	tree->root->right->left = new TreeNode(1);
	tree->root->left->left = new TreeNode(7);
	tree->root->left->left->left = new TreeNode(10);
	tree->root->left->left->right = new TreeNode(3);
	tree->root->right->left->right = new TreeNode(4);
	tree->root->right->left->left = new TreeNode(7);
	/*
	  Given Binary Tree
	  -----------------------
	         5
	        /  \ 
	       /    \
	      3      9
	     / \    / \
	    7   6  1   3
	   / \    / \   
	  10  3  7   4
	  Here
	  Odd path from root to leaf
	  -----------------------
	         5
	        /  \ 
	       /    \
	      3      9
	     /      / \
	    7      1   3
	     \    /     
	      3  7    
	  ---------------------
		5->3->7->3    
		5->9->1->7  
	    5->9->3  
	  ----------------------
	  Result : 3 [number of path]
	*/
	// Count odd nodes paths from root
	// to leaf in a binary tree.
	cout << tree->countOddNodePath(tree->root) << endl;
	return 0;
}

Output

3

Comment

Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment