Description: Classic examples of data structures, in-depth understanding of binary tree. Such as: to check the level of each node, the node from the root to shoot length (path length), the number of offspring and the number of ancestors. Each node of the first order, in order, the order of the access number.
To Search:
- [path] - To find (in Binary Tree) from the root n
File list (Check if you may need any files):
实习题\5070309538_2.dsp
......\5070309538_2.dsw
......\5070309538_2.ncb
......\5070309538_2.opt
......\5070309538_2.plg
......\feature.h
......\main.cpp
实习题
Download