public void add(QA e)
{
node n = new node(e);
if (root == null)
{
root = n;
}
else
{
node temp = root;
while (true)
{
int x = e.Question1.CompareTo(root.value.Question1);
if (x == 1)
{
if (temp.right != null)
{
temp = temp.right;
}
else
{
temp.right = n;
break;
}
}
else
{
if (temp.left != null)
{
temp = temp.left;
}
else
{
temp.left = n;
break;
}
}
}
}
}
private void InOrder(node n, ref string Answer, string Question)
{
if (n != null)
{
InOrder(n.left, ref Answer, Question);
if (Question == n.value.Question1)
{
Answer = n.value.Answer1;
}
InOrder(n.right, ref Answer, Question);
}
}
