python二叉树递归求和
作者:互联网
class BiTNode: def __init__(self, data, left, right): self.data = data self.left = left self.right = right t = BiTNode(10, BiTNode(2,None,None), BiTNode(3,None,None)) def sum_tree(t:BiTNode): total=0 if t != None: total += t.data total += sum_tree(t.left) total += sum_tree(t.right) return total sum_tree(t)
15
标签:None,right,递归,python,self,tree,BiTNode,二叉树,total 来源: https://www.cnblogs.com/xiexiaokui/p/12931855.html