/// <summary>
/// 作者:GENGWEI
/// </summary>
/// <summary>
/// 在线索二叉树P节点后插入S节点
/// </summary>
/// <param name="p"></param>
/// <param name="s"></param>
static void InsertNode(TNode p,TNode s)
{
TNode q;
if (p.RTag == Tag.Thread)
{
s.right = p.right;
s.RTag = Tag.Thread;
p.right = s;
p.RTag = Tag.Link;
}
else
{
q = p.right;
while (q.LTag == Tag.Link)
q = q.left;
q.left = p.right;
s.RTag = Tag.Link;
p.right = s;
}
s.left = p;
s.LTag = Tag.Thread;
}