在VC++6.0编译器环境下完成红黑树的删除，基于C++源码的编程 直接新建满足条件的红黑树，然后删除选定的结点-In VC++6.0 compiler environment to complete the removal of red-black tree, based on C++ source code directly to the new programming to meet the conditions of the red-black tree, and then delete

现在要对一棵二叉树的节点进行染色。每个节点可以被染成红色、绿色或蓝色。并且，一个节点与其子节点的颜色必须不同，如果该节点有两个子节点，那么这两个子节点的颜色也必须不相同。给定一棵二叉树的二叉树序列，请求出这棵树中最多和最少有多少个点能够被染成绿色。-Now to node of two binary tree were stained. Each node can be dyed red, green or blue. Moreover, a node and its child nodes m