Node& Tree::findNode(string name, int id)
{
	Node n = *root;
	Node f = Node("1", -1);
	Node x = searchForNode(n, name, id, f);
	return x;
}

Node& Tree::searchForNode(Node &root, string name, int id, Node &not_found)
{
	if ((root.getName()).compare(name) == 0 && root.getID() == id)
	{
		return root;
	}
	vector<Node*> children = root.getChildren();
	for (int i = 0; i < children.size(); i++)
	{
		Node* n = children[i];
		Node temp = searchForNode(*n, name, id, not_found);
		if (!temp.equals(not_found))
		{
			return temp;
		}
	}
	return not_found;
}