<python简单二叉树遍历代码>
标签: <无>
- [python简单二叉树遍历代码代码][Python]代码
#B tree
class TreeNode:
def __init__(self,x):
self.val=x
self.left=None
self.right=None
def builtTree():
root=None
val=input("Enter the value:")
if(val=='#'):
pass
else:
root=TreeNode(val)
root.left=builtTree()
root.right=builtTree()
return root
def PreTraver(root):
if root==None:
return
else:
print(root.val,end=" ")
traver(root.left)
traver(root.right)
def MidTraver(root):
if root==None:
return
MidTraver(root.left)
print(root.val,end=" ")
MidTraver(root.right)
def ReTraver(root):
if root==None:
return
ReTraver(root.left)
ReTraver(root.right)
print(root.val,end=" ")
def deepth(root):
if