链表二叉树构造

1、链表构造

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
def listnodeInput(nums):
    dummy = ListNode(0)
    root = ListNode(nums[0])
    dummy.next = root
    i = 1
    while i < len(nums):
        node = ListNode(nums[i])
        root.next = node
        root = node
        i += 1
    return dummy.next       

2、二叉树构造

class TreeNode:
    def __init__(self, val, left = None, right = None):
        self.val = val
        self.left = left
        self.right = right
def treenodeInput(nums, index):
    if index >= len(nums):
        return
    if nums[index] == 0:
        return None
    left = index * 2 + 1
    right = index * 2 + 2
    root = TreeNode(nums[index])
    root.left = treenodeInput(nums, left)
    root.right = treenodeInput(nums, right)
    return root