文件名称:4_subTree
介绍说明－－下载内容均来自于网络，请自行研究使用
给定两棵二叉树，求出它们所有节点数大于等于2的最大子树。
二叉树的子树，是指去掉这棵二叉树的某些节点以及与这些节点相连的枝而得到的二叉树。设T为二叉树，R为它的子树，如果不存在二叉树S，使得R为S的子树且S为T的子树，那么称R为T的最大子树。-Given two binary trees, find them all nodes greater than or equal to 2 maximum subtree. A sub binary tree, the binary tree is removed and some of the nodes connected to the node with the obtained binary tree branches. Let T be a binary tree, R for its subtree, if there is no binary S, such that R is S, and S is the sub-tree subtree of T, then R is called a subtree of T max.
二叉树的子树，是指去掉这棵二叉树的某些节点以及与这些节点相连的枝而得到的二叉树。设T为二叉树，R为它的子树，如果不存在二叉树S，使得R为S的子树且S为T的子树，那么称R为T的最大子树。-Given two binary trees, find them all nodes greater than or equal to 2 maximum subtree. A sub binary tree, the binary tree is removed and some of the nodes connected to the node with the obtained binary tree branches. Let T be a binary tree, R for its subtree, if there is no binary S, such that R is S, and S is the sub-tree subtree of T, then R is called a subtree of T max.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
4_subTree\FindAllComSubTree.cpp
.........\subTree01.cpp
.........\subTree02.cpp
.........\subTree03.cpp
4_subTree