Python implements printing of all nodes in a layer of a binary tree

Not much to say, direct patch, as shown below

#-*-coding:utf-8-*-#Defining a binary tree node classclassTreeNode (object):def __init__(self,data=0,left=0,right=0): Self.data=Data Self.left=Left Self.right= Right#traverse all nodes of a layer and printdefTranslevel (root,level):ifRoot = =None:return    Else:        ifLevel = = 1 andisinstance (Root, TreeNode):Print "%s"%Root.data,Else:            ifisinstance (Root, TreeNode): Translevel (Root.left, level-1) Translevel (root.right, level-1)#established two-fork tree# ------------------------#Root#7 8#6#2 5#1 3 4## -------------------------N1= TreeNode (data=1) N2= TreeNode (2, n1,0) N3= TreeNode (3) N4= TreeNode (4) N5= TreeNode (5, N3,n4) N6= TreeNode (6, n2,n5) N7= TreeNode (7, n6,0) N8= TreeNode (8) Root= TreeNode ('Root', N7,N8) Translevel (Root,5)

Resources:

1. Implementation of binary tree traversal of Python data structure
Http://www.cnblogs.com/yupeng/p/3414451.html

2. Print the nodes of a certain layer of the binary tree
Http://www.cnblogs.com/-Lei/archive/2013/02/25/2928629.html

Python implements printing of all nodes in a layer of a binary tree