static Node()
{
empty = new Node(null, -1);
}
public void Add(Node child)
{
child.array[child.index].sibling = array[index].child;
array[index].child = child.id;
}
public void Remove(Node previous, Node child)
{
if (previous.id == id)
{
array[index].child = child.array[child.index].sibling;
}
else
{
previous.array[previous.index].sibling = child.array[child.index].sibling;
}
}
public static bool IsEmpty(Node node)
{
return node.id == -1;
}
