Description: Programming tasks: For a given of the tree, in order to root node as a starting point, right tree implementation non-recursive way of breadth-first search, the output breadth-first search sequence Data Input: by the file input.txt given input data. First 1 Line There are 1 positive integer n, represents a given binary tree with n vertices, numbered 1,2, ..., n. The following n row, each line has three positive integers a, b, c, respectively indicate the reference numbers as a, node point of a left son of node point number is b, right-his son node point number as the c, 0 indicates no sons. Each of the balance point information in accordance with the layer sequence the order of tables are given.
To Search:
File list (Check if you may need any files):
实验四
......\bfs.cpp
......\BFS.H
......\Debug
......\.....\bfs.obj
......\.....\input.txt
......\.....\main.obj
......\.....\output.txt
......\.....\vc60.idb
......\.....\vc60.pdb
......\.....\实验四.exe
......\.....\实验四.ilk
......\.....\实验四.pch
......\.....\实验四.pdb
......\input.txt
......\main.cpp
......\output.txt
......\实验四.dsp
......\实验四.dsw
......\实验四.ncb
......\实验四.opt
......\实验四.plg
Download