I NEED THE ANSWER ASAP I WILL GIVE THUMBS UP.

7. Given following binary node implementation, how the inorder traversal can be implemented? The function header traverse() is given, please write out its codes. (10 pts) // Node implementation with simple inheritance class VarBinNode { // Node abstract base class public: virtual "VarBinNode() () virtual bool isLeaf () = 0; // Subclasses must implement }; class LeafNode : public VarBinNode { // Leaf node private: Operand var; // Operand value public: LeafNode (const Operanda val) { var = val; } // Constructor bool isLeaf () { return true; } // Version for LeafNode Operand value () { return var; } // Return node value ); class IntlNode : public VarBinNode { // Internal node private: VarBinNode* left; // Left child VarBinNode* right; 1/ Right child Operator opx; // Operator value public: Int INode (const Operatora op, VarBinNode+ 1, VarBinNode# r) { opx - op; left = 1; right = r; } // Constructor bool isLeaf () { return false;) 1/ Version for IntlNode VarBinNode* leftchild() { return left;) // Left child VarBinNoderight child() { return right; } // Right child Operator value() { return opx;) 1/ Value ); The function header: void traverse (VarBinNode *root)