Description: The main process: the establishment of a general binary list, for through the traverse line, and set up to deal with p for the current node, pre filled for signs precursor p: p if not left: p-> ltag = 1 if the p-free Right: p-> rtag = 1 filling clue: If p-> ltag == 1: p-> lchild = pre if the pre-> rtag == pre-> rchild = p
To Search:
File list (Check if you may need any files):
二叉树的基本运算btree.cpp
Download