Inorder traversal of binary tree with recursion in c++

C++ program for Inorder traversal of binary tree with recursion. Here problem description and explanation.

// Include header file
#include <iostream>
using namespace std;
/*
  C++ Program for
  inorder tree traversal of a Binary Tree
  using recursion
*/
// 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;
	}
	// Display Inorder view of binary tree
	void inorder(TreeNode *node)
	{
		if (node != nullptr)
		{
			// Visit left subtree
			this->inorder(node->left);
			//Print node value
			cout << "  " << node->data;
			// Visit right subtree
			this->inorder(node->right);
		}
	}
};
int main()
{
	// Create new tree
	BinaryTree *tree = new BinaryTree();
	/*
	    Make A Binary Tree
	    ----------------
	        15
	       /  \
	      24   54
	     /    /  \
	    35   62   13
	*/
	// Add tree TreeNode
	tree->root = new TreeNode(15);
	tree->root->left = new TreeNode(24);
	tree->root->right = new TreeNode(54);
	tree->root->right->right = new TreeNode(13);
	tree->root->right->left = new TreeNode(62);
	tree->root->left->left = new TreeNode(35);
	// Display Tree Node
	tree->inorder(tree->root);
	return 0;
}

Output

  35  24  15  62  54  13


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







© 2021, kalkicode.com, All rights reserved