Description: The following questions require a unified solution in a large program. Extension of the first-traversal sequence to establish the storage structure of the binary tree binary tree preorder, inorder, postorder traversal of a binary tree traversal recursive algorithm non-recursive algorithm for binary-level non-recursive algorithm for traversing a binary tree depth (after preorder) established tree storage structure required depth of the tr
To Search:
File list (Check if you may need any files):
6_树和二叉树\Debug\StdAfx.obj
............\.....\vc60.idb
............\.....\vc60.pdb
............\.....\树和二叉树_6.exe
............\.....\树和二叉树_6.ilk
............\.....\树和二叉树_6.pch
............\.....\树和二叉树_6.pdb
............\max.cpp
............\~VC3D61.tmp
............\树和二叉树_6.cpp
............\树和二叉树_6.dsp
............\树和二叉树_6.dsw
............\树和二叉树_6.ncb
............\树和二叉树_6.opt
............\树和二叉树_6.plg
............\Debug
6_树和二叉树
Download