I know nothing about Minmax tree, but a linked list is just a series of nodes basically. A tree structure is based on this same principle, but instead of sequential items in a list/queue fashion each node can point to multiple children.
Example of a combo:
Code:
#include <list>
using std::list;
struct node // Will represent each tree node.
{
// Put data variables here that would go in each node. Ex:
int value;
list <node> children; // Contains a list of all this node's children.
}
class Tree
{
public:
Tree()
{
treeRoot.value = 5;
node tempChild;
tempChild.value = 3;
treeRoot.children.push_back(tempChild); // Add this node to the children of treeRoot.
tempChild.value = 1;
treeRoot.children.push_back(tempChild);
};
private:
node treeRoot; // Base of your tree.
}
I believe the above code as is would make the following tree:
