How does this approach of VarBinNode implementation handle traversals?

class public: VarBinNodeData Structures and Algorithm Analysis by Cliffor A. Shaffer virtual ~VarBinNode) ) virtual bool isLeaf() = 0; Option 1 class LeafNode public VarBinNode private: Operand var; public: Traversal separate from nodes LeafNode (const Operand& val) var val; bool isLeaf () return true Operand value) return var; //Do a inorder traversal void traverse (VarBinNode* root) ( if (root= NULL) return; if (root->isLeaf) cout leftchild)) cout value()