Description: Assumed that the input to the following description of the ternary group (F, C, L/R) sequence of a binary tree plurilateral (wherein F represents the identity of the parent node, C represents the identity of the child node represents C, L/R F, The left child or right child), and the sequence of the input triples, C is a hierarchical order appears. The set node identification is a character type. F = ' ^' C is the root node identification, if C is also a ' ^' , it indicates the end of input. Try to write algorithms, the establishment of a binary tree binary list by the triples sequence input, and output inorder sequence.
To Search:
File list (Check if you may need any files):
tree_sanyuanzu.cpp
Download