Help me understand some code from a BST

[tatteredpotato]

We've been going over Binary Search Trees in class, and we have an assignment to implement an address book with a BST. Our prof gave us the code for a BST, however there is one thing I'm unfamiliar with.


template <class KeyType, class DataType>
void BST<KeyType, DataType>::traverse(TraverseType traverseType, void (*visit)(KeyType, DataType))

or particularly:

void (*visit)(KeyType, DataType)

I'm just unsure as to how to interpret this line.

 

[Ken g6]

It looks like a function pointer to me.

Edit: I've done too many [[Wikipedia links]] lately. 😉

 

[Cogman]

YIKES, your teacher should be shot for introducing that so soon. It is a function pointer, basically he wants you to write the traversal function for the bst.

But like I said, he should be shot for introducing it as it is completely uncalled for in this type of scenario

 

[tatteredpotato]

Originally posted by: Cogman
YIKES, your teacher should be shot for introducing that so soon. It is a function pointer, basically he wants you to write the traversal function for the bst.

But like I said, he should be shot for introducing it as it is completely uncalled for in this type of scenario

Thanks for the help... I really mostly needed a name to put to the concept so I can do some research.