Description: A certain period, A B between army troops and a war breaks out. A military order to prevent easily find their headquarters, B Army planted a binary tree type of formation, so that both can communicate with each other, but also can be a good hiding spot headquarters. A total of n nodes, each with a numbered, headquartered in one of these nodes. Know the former military headquarters preorder in row B in the first m-bit string label. A military find data structures you have learned, you get the pre-order traversal B Army based on known preorder and postorder traversal, and draw B army headquarters on exactly how much the node labeled.
To Search:
File list (Check if you may need any files):
第07讲作业(2)
.............\Debug
.............\.....\第07讲作业(2).exe
.............\.....\第07讲作业(2).ilk
.............\.....\第07讲作业(2).pdb
.............\第07讲作业(2)
.............\第07讲作业(2).sdf
.............\第07讲作业(2).sln
.............\第07讲作业(2).v11.suo
.............\.............\Debug
.............\.............\.....\CL.read.1.tlog
.............\.............\.....\CL.write.1.tlog
.............\.............\.....\link-cvtres.read.1.tlog
.............\.............\.....\link-cvtres.write.1.tlog
.............\.............\.....\link-rc.read.1.tlog
.............\.............\.....\link-rc.write.1.tlog
.............\.............\.....\link.read.1.tlog
.............\.............\.....\link.write.1.tlog
.............\.............\.....\vc110.idb
.............\.............\.....\vc110.pdb
.............\.............\.....\第07讲作业(2).lastbuildstate
.............\.............\.....\第07讲作业(2).log
.............\.............\.....\第07讲作业(2).obj
.............\.............\第07讲作业(2).cpp
.............\.............\第07讲作业(2).vcxproj
.............\.............\第07讲作业(2).vcxproj.filters
Download