Description: Assuming the following description of the triple (F, C, L/R) sequence of a binary tree of all the input side (where F that identifies the parent node, C, said child node ID, L/R that C is F, left or right child child), and triples in the input sequence, C is the emergence of a hierarchical order. Node identity is established character types. F = ' ^' C for the root identity when, if C is also a ' ^' , then enter the end. Test preparation algorithm, the input sequence of triples binary build the binary tree list, and in order to sequence the output. ^ AL ABL ACR BDL CEL CFR DGR FHL ^ ^ L
To Search:
- [binary_tree] - Text for a written in c used to produce
File list (Check if you may need any files):
tree.cpp
Download