class Tree(object):
def __init__(self,val):
self.val=val
self.left,self.right=None,None
class Solution:
def width(self,root):
queue=[root]
while queue:
temp=queue.pop(0)
print(temp.val,end=' ')
if temp.left is not None:
queue.append(temp.left)
if temp.right is not None:
queue.append(temp.right)
def preorder(self,node):
if not node:
return
print(node.val,end=' ')
self.preorder(node.left)
self.preorder(node.right)
def preorderTraversal(self, root):
if root == None:
return []
return [root.val] + self.preorderTraversal(root.left) \
+ self.preorderTraversal(root.right)
【自己记录】Python 二叉树
最新推荐文章于 2021-07-25 18:32:09 发布