Description: Assuming that the top-down hierarchy, from left to right input each node is a triple (N, P, L/R). N oriented junction element the P their husband junction point, L indicator N is the left child of P, R indicator N is the right child of P. Try to write an algorithm build a binary tree in memory double-stranded and first root, root, dorsal root sequence traversal algorithm.
To Search:
File list (Check if you may need any files):
erchashu.c
Download