/*
 * mtree.cpp
 *
 *  Created on: 28.11.2013
 *      Author: trifon
 */

#include "tree.h"
#include "linked_list.cpp"

class Employee {
	char name[100];
	Employee* boss;
	// !!! Employee boss;
};

template <typename T>
class MTree : public Tree<T, LinkedListIterator<MTree<T> > > {
private:
	T data;
	LinkedList<MTree<T> > subtrees;
public:
	typedef LinkedListIterator<MTree<T> > I;

	MTree(T _data = 0) : data(_data) {}

	MTree& addChild(MTree<T> const& t) {
		subtrees.toEnd(t);
		return *this;
	}

	T root() const {
		return data;
	}

	I iterator() const {
		return subtrees.begin();
	}
};

template <typename T>
ostream& operator<<(ostream& os, MTree<T> const& t) {
	os << '(' << t.root() << ' ';
	for(typename MTree<T>::I it = t.iterator(); it; ++it)
		os << *it << ' ';
	return os << ')';
}