Description: 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.
To Search:
File list (Check if you may need any files):
3013216047_二班_孙铭啸_第四次实验作业\二叉树.cpp
.....................................\二叉树.exe
.....................................\二叉树染色问题.docx
.....................................\后序遍历.cpp
.....................................\后序遍历.docx
.....................................\后序遍历.exe
3013216047_二班_孙铭啸_第四次实验作业
Download