(self, node, leaf_num=10, cut_level=3, rebuild=0)
Args:
            node: Node对象,子节点
            rebuild: 0代表创建树阶段，1代表匹配模板是重构树
        Returns:
Args:
            node: Node对象,子节点
            rebuild: 0代表创建树阶段，1代表匹配模板是重构树
        Returns:
Args : node : Node对象 子节点 rebuild : 0代表创建树阶段，1代表匹配模板是重构树 Returns :
def add_child_node(self, node, leaf_num=10, cut_level=3, rebuild=0):
        """
        Args:
            node: Node对象,子节点
            rebuild: 0代表创建树阶段，1代表匹配模板是重构树
        Returns:
        """
        global max_org
        # 10个叶子节点会剪枝
        # 根节点不受剪枝限制
        node._level=self._level+1
        # if self._level>cut_level and len(self._children) == leaf_num: #超过10个节点剪枝
        if max_org < len(self._children):
            max_org = len(self._children)

        if self._level>cut_level and len(self._children) == leaf_num and self._no_cutting != 1 and rebuild == 0:
        # if self._level>cut_level and len(self._children) == leaf_num and self.get_data() != 'org': #超过10个节点剪枝
            self.delete_children()
            return False 

        if self._change_to_leaf == 1:
            return False

        node._father = self
        self._children.append(node)
def add_child_node ( self , node , leaf_num = 10 , cut_level = 3 , rebuild = 0 ) : global max_org # 10个叶子节点会剪枝 # 根节点不受剪枝限制 node . _level = self . _level + 1 # if self._level>cut_level and len(self._children) == leaf_num: #超过10个节点剪枝 if max_org < len ( self . _children ) : max_org = len ( self . _children ) if self . _level > cut_level and len ( self . _children ) == leaf_num and self . _no_cutting != 1 and rebuild == 0 : # if self._level>cut_level and len(self._children) == leaf_num and self.get_data() != 'org': #超过10个节点剪枝 self . delete_children ( ) return False if self . _change_to_leaf == 1 : return False node . _father = self self . _children . append ( node )