现在要对一棵二叉树的节点进行染色。每个节点可以被染成红色、绿色或蓝色。并且，一个节点与其子节点的颜色必须不同，如果该节点有两个子节点，那么这两个子节点的颜色也必须不相同。给定一棵二叉树的二叉树序列，请求出这棵树中最多和最少有多少个点能够被染成绿色。-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 must be a different color, if the node has two child nodes, then the two child nodes must also be not the same color. Two tree given sequence of a two binary tree, this tree request most and least how many points can be dyed green.