python二叉树增加节点_python 实现二叉树 求二叉树的叶子节点个数

#coding=utf-8

class Node(object):

"""节点类"""

def __init__(self, elem=-1, lchild=None, rchild=None):

self.elem = elem

self.lchild = lchild

self.rchild = rchild

class Tree(object):

"""树类"""

def __init__(self):

self.root = Node()

self.myQueue = []

def add(self, elem):

"""为树添加节点"""

node = Node(elem)

if self.root.elem == -1: # 如果树是空的，则对根节点赋值

self.root = node

self.myQueue.append(self.root)

else:

treeNode = self.myQueue[0] # 此结点的子树还没有齐。

if treeNode.lchild == None:

treeNode.lchild = node

self.myQueue.append(treeNode.lchild)

else:

treeNode.rchild = node

self.myQueue.append(treeNode.rchild)

self.myQueue.pop(0) # 如果该结点存在右子树，将此结点丢弃。

def leave(self,root): #递归求叶子节点个数

if root==None:

return 0

elif root.lchild ==None and root.rchild == None :

return 1

else:

return (self.leave(root.lchild)+self.leave(root.rchild))

if __name__ == '__main__':

"""主函数"""

elems = range(10) #生成十个数据作为树节点

tree = Tree() #新建一个树对象

for elem in elems:

tree.add(elem) #逐个添加树的节点

print '\n叶子节点个数:'

num = tree.leave(tree.root)

print num