测试用二叉树生成代码

在005里给的任务

能用就行啦。
尝试以后加入单元测试模块

class TreeNode(object):
    def __init__(self, val):
        self.val = val
        self.left = None
        self.right= None

def generateTree(dList = []):
    if dList == []:
        return None
    root = TreeNode(dList[0])
    queue = [root]
    counter = 1
    for node_parent in queue:
        # 左侧节点
        if counter < len(dList):
            if dList[counter] != None:
                node_left = TreeNode(dList[counter])
                queue.append(node_left)
            else:
                node_left = None
        else:
            node_left = None
        counter += 1
        # 右侧节点
        if counter < len(dList):
            if dList[counter] != None:
                node_right = TreeNode(dList[counter])
                queue.append(node_right)
            else:
                node_right = None
        else:
            node_right = None
        counter += 1
        node_parent.left = node_left
        node_parent.right = node_right
    return root

def bfs(root):
    queue = [root]
    # 直接用in遍历列表就可以实现队列的效果
    for i in queue:
        if i.left != None:
            queue.append(i.left)
        if i.right!= None:
            queue.append(i.right)
    return queue