#include <iostream>
using namespace std;

struct node 		// C++  -  a struct is a type
{  string name;
   node *left;		// pointers to subtrees
   node *right;
   int value;   	//{TRUE = 1 for the marked node}
};

void tree(node* branch)		// inorder traverse of binary tree
{   if (branch)
    { tree(branch->left);
      cout << branch-> name << endl;
      tree (branch->right);
    }
}

int main(){

node node2 = {"apple",0,0,0};
node node4 = {"plum",0,0,0};
node node3 = {"peach",0,&node4,1};
node root = {"orange",&node2, &node3,0};   /* has to come after subtree defs */

tree(&root);	//& means "pass the ADDRESS"

//cout << root.name << endl;
return 0;
}