Description: Write an algorithm to do the following: no repeat output to all sides in children the brothers linked list storage tree T (where the edge is the branch of the tree T, rather than the child brother chain formed binary tree branch). The output in the form of the (k1, k2), ..., (ki, kj), ..., wherein Ki and kj tree node in the node identification.
To Search:
File list (Check if you may need any files):
traver\BiTree.h
......\define.cpp
......\main.cpp
......\traver.dsp
......\traver.dsw
......\traver.ncb
......\traver.opt
......\traver.plg
traver
Download