Description: By way of binary string, you can create the corresponding binary tree, and can be implemented recursively. Similarly, for any binary tree, the corresponding string can be generated. Including the creation of a binary tree (including the empty tree and ordinary tree) the specified string, the binary string according to the specified output to determine whether an empty tree,
The total number of computing nodes of the binary tree, calculate the total number of leaves of a binary tree, calculate the height of a binary tree, wherein the height of the empty tree and ordinary trees are 0 and 1, the former preorder output binary tree, separated by commas, preorder output binary tree, separated by commas after preorder output binary tree, separated by commas, empty tree functions
To Search:
File list (Check if you may need any files):
Binary Tree\Debug\vc60.idb
...........\.....\vc60.pdb
...........\.....\二叉树.pch
...........\.....\二叉树.pdb
...........\.....\二叉树.exe
...........\.....\二叉树.obj
...........\.....\二叉树.ilk
...........\二叉树.ncb
...........\二叉树.plg
...........\stdafx.h
...........\二叉树.cpp
...........\二叉树.dsp
...........\二叉树.opt
...........\二叉树.dsw
...........\Debug
Binary Tree
Download