Description: 1) The process established by the first order recursive binary tree (memory structure: binary list) input data sequence obtained by first traversing the input, when a node in the left subtree or right subtree is empty, enter ' *' number, such as Enter abc** d** e** 2) write a recursive algorithm to calculate a binary tree the number of leaf nodes. 3) The concave form by way of the output of the binary tree.
To Search:
File list (Check if you may need any files):
二叉树\Debug\二叉树.exe
......\.....\二叉树.ilk
......\.....\二叉树.pdb
......\二叉树\Debug\BuildLog.htm
......\......\.....\mt.dep
......\......\.....\vc90.idb
......\......\.....\vc90.pdb
......\......\.....\二叉树.exe.intermediate.manifest
......\......\.....\二叉树.obj
......\......\二叉树.cpp
......\......\二叉树.vcproj
......\......\二叉树.vcproj.zh-PC.zh.user
......\二叉树.ncb
......\二叉树.sln
......\二叉树.suo
......\......\Debug
......\Debug
......\二叉树
二叉树
Download