数据结构教学课件第08章.ppt

void First(ThreadBiTree *tree) { tree-current = tree-root; while(tree-current-leftThread == 0 tree-current = tree-current-leftChild; ? if(tree-current == tree-root) tree-nextComplete = 1; else tree-nextComplete = 0; } ? void Next(ThreadBiTree *tree) { ThreadBiNode *p = tree-current-rightChild; if(tree-nextComplete == 1) return; if(tree-current-rightThread == 0) while(p-leftThread == 0) p = p-leftChild; tree-current = p; if(tree-current == tree-root) tree-nextComplete = 1; } ? int E