二叉樹的廣度優先搜索

# Definition for a binary tree node. # class TreeNode(object): # def __init__(self, x): # self.val = x # self.left = None # self.right = None def bfs(self,root)

>>阅读原文<<