二叉树面试问题1:计算一共有多少个节点。
'''算法思想:运用递归的思想,迭代计算出节点的个数。
遍历二叉树,分别计算左子树和右子树的节点个数,依次递归,最后返回左子树和右子树的总数和+1
'''
代码实现:
class Node(object):
'''节点类'''
def __init__(self, elem, lchild=None, rchild=None):
self.elem = elem
self.lchild = lchild
self.rchild = rchild
def TotalPoint(tree):
total = 0
if tree == None:
return 0
else:
total += 1
ltotal = TotalPoint(tree.lchild)
rtotal = TotalPoint(tree.rchild)
return ltotal + rtotal + 1
if __name__=='__main__':
tree = Node('D',Node('B',Node('A'),Node('C')),Node('E',rchild=Node('G',Node('F'))))