Description: Here bread containing four small program, are binary tree coloring problem, according to the postorder traversal of binary tree preorder traversal and traversal in order to calculate, the queue order preserving properties, simulated wicket service to solve practical problems, the branch since the problem, the four procedures are complete program solve with recursive algorithm, hope can help.
To Search:
File list (Check if you may need any files):
根据二叉树的先序遍历和中序遍历求出后序遍历.cpp
利用队列的保存顺序特性，模拟售票口服务解决实际问题.cpp
用递归算法解决分橘子问题.cpp
二叉树染色问题.c
Download