Check for foldable binary tree in c++

C++ program for Check for foldable binary tree. Here problem description and other solutions.

// Include header file
#include <iostream>
using namespace std;
/*
  C++ program for
  Check if binary tree is foldable 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;
	}
	bool isFoldable(TreeNode *leftRoot, 
                    TreeNode *rightRoot)
	{
		if (leftRoot == nullptr && rightRoot == nullptr)
		{
			// When both node empty
			return true;
		}
		else if (leftRoot != nullptr && rightRoot != nullptr && 
                 this->isFoldable(leftRoot->left, rightRoot->right) && 
                 this->isFoldable(leftRoot->right, rightRoot->left))
		{
			// When
			// Valid the properties of foldable tree
			return true;
		}
		// Fail case
		return false;
	}
	// Display tree element inorder form
	void inorder(TreeNode *node)
	{
		if (node != nullptr)
		{
			// Visit to left subtree
			this->inorder(node->left);
			// Print node value
			cout << "  " << node->data;
			// Visit to right subtree
			this->inorder(node->right);
		}
	}
};
int main()
{
	// Create new tree
	BinaryTree *tree = new BinaryTree();
	/*
	   Binary Tree
	  -----------------------
	       5
	     /   \
	    7     4
	   /       \
	  1         2
	   \       /
	    2     5
	*/
	// Binary tree nodes
	tree->root = new TreeNode(5);
	tree->root->left = new TreeNode(7);
	tree->root->right = new TreeNode(4);
	tree->root->left->left = new TreeNode(1);
	tree->root->right->right = new TreeNode(2);
	tree->root->right->right->left = new TreeNode(5);
	tree->root->left->left->right = new TreeNode(2);
	// Display Tree elements
	tree->inorder(tree->root);
	bool result = tree->isFoldable(tree->root->left, 
                                   tree->root->right);
	if (result == true)
	{
		cout << "\n Foldable Tree" << endl;
	}
	else
	{
		cout << "\n Not Foldable Tree" << endl;
	}
	/*
	         5
	       /   \
	      7     4
	     /       \
	    1         2
	     \       /
	      2     5
	       \
	        3  
	*/
	// Case 2
	tree->root->left->left->right->right = new TreeNode(3);
	tree->inorder(tree->root);
	result = tree->isFoldable(tree->root->left, 
                              tree->root->right);
	if (result == true)
	{
		cout << "\n Foldable Tree" << endl;
	}
	else
	{
		cout << "\n Not Foldable Tree" << endl;
	}
	return 0;
}

Output

  1  2  7  5  4  5  2
 Foldable Tree
  1  2  3  7  5  4  5  2
 Not Foldable Tree