Description: In the following description of the three tuple hypothesis ( F, C, L/R ) sequence input a two fork tree plurilateral ( wherein F represents the parent node ID, C said the child node ID, said L/R C F children left or right child ), and in the three input tuple sequence, C is based on the layer order. A node identifier is the type of character. F= C ^ is the root node ID, if C is also a ^ , said the end of input. try to write algorithm, from the input of the three tuple sequence to establish a binary tree of two two binary list, and to the sequence in the sequence output.
To Search:
File list (Check if you may need any files):
andian.cpp
andian.dsw
andian.dsp
andian.plg
andian.opt
andian.ncb
Debug\vc60.idb
.....\vc60.pdb
.....\andian.pch
.....\andian.obj
.....\andian.ilk
.....\andian.exe
.....\andian.pdb
Debug
Download