python构建二叉树测试用例–返回根节点
# 定义树节点.
class TreeNode(object):
def __init__(self, x):
self.val = x
self.left = None
self.right = None
#将输入的列表转化为一棵二叉树,返回根节点
def deserialize(data):
def dfs(data):
val = data.pop(0)
if