求一位师父????
template <class T>
void ThreadTree<T>::createInThread(ThreadNode<T> * current,
ThreadNode<T> *& pre){
if(current == NULL) return;
createInTread(current->leftChild == NULL)
if (current -> leftChild == NULL)
{
current -> leftChild = pre; current ->ltag = 1;
}
if (pre != NULL && pre ->rightChild == NULL)
{
pre -> rightChild = current; pre -> rtag = ;
}
pre = current;
createInThread(current -> rightChild, pre);
};
这是二叉树的中序线索化
请教有哪位高手能对上面函数以追踪 各指针的传递 给我讲解一下这算法是如何实现中序线索化
尤其是划直线部分
谢谢