USE BinaryNode structure as provided to:

template

struct BinaryNode

{

Object element;

BinaryNode *left;

BinaryNode *right;

BinaryNode(const Object & theElement, BinaryNode *lt= nullptr, BinaryNode *rt=nullptr)

: element{ theElement }, left{ lt }, right{ rt } { }

};

//A recursive function that takes an expression and makes the tree

template

void MakeTree(string expr, BinaryNode

{

}

//recursive function that prints the tree in Postfix equivalent

template

void Postfix(BinaryNode

{

}

Part a:

Write recursive functions that computes the following

depth of a node

The depth of a node is the number of edges from the node to the tree's root node.

height of a node

The height of a node is the number of edges on the longest downward path between that node and a leaf.

Part b:

Write the following recursive functions,

Function that takes an expression and makes the tree

void MakeTree(string expr, BinaryNode

Function that prints the tree in Postfix equivalent

template

void Postfix(BinaryNode

{

}

Function that prints the tree in Infix equivalent

template

void Infix(BinaryNode

{

}

Test with the below given main which should produce the output:

BinaryNode* root = new BinaryNode(' ');

int pos = 0;

cout

MakeTree("((a+(b*c))+(((d*e)+f)*g))", root,pos);

cout

Postfix(root);

cout

Infix(root);

PLEASE answer clearly with comments. Will provide a thumbs up if above rules followed and desired output is achieved :)

CAUsers pkolliNDesktop\Fall18 CMP305\FileSystem\DebugBinary.exe Expression-((a+(bc))+( ((de)+f) g)) Postfix equivalent: a bcdef+ g * + Infix equivalent: + a(bc)) Press any key to continue de)f)g) CAUsers pkolliNDesktop\Fall18 CMP305\FileSystem\DebugBinary.exe Expression-((a+(bc))+( ((de)+f) g)) Postfix equivalent: a bcdef+ g * + Infix equivalent: + a(bc)) Press any key to continue de)f)g)