package main

import (
	"fmt"
)
//链表结构体
type ListNode struct {
	Val int
	Next *ListNode
}
//使用数组创建对应的链表 后插法
func createList(nums []int) *ListNode {
	prev := new(ListNode)
	prev.Val = nums[0]
	prevHead := new(ListNode)
	prevHead = prev
	for i:=1;i<len(nums);i++ {
		temp := new(ListNode)
		temp.Val = nums[i]
		prev.Next = temp
		prev = temp
	}
	return prevHead
}
//显示链表中的所有元素
func ShowList(L *ListNode) {
	temp := L
	for temp != nil {
		fmt.Print(temp.Val," ")
		temp = temp.Next
	}
	fmt.Println()
}

//二叉树结构体
type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}


//创建二叉树
func createTree(nums []int, len int, index int) *TreeNode {
	root := new(TreeNode)
	if index < len && nums[index] != -1 {
		root.Val = nums[index]
		if 2*index+1 < len {
			root.Left = createTree(nums, len, 2*index+1)
		}
		if 2*index+2 < len {
			root.Right = createTree(nums, len, 2*index+2)
		}
	}
	return root
}

//二叉树的层序遍历 输出到一个二维数组中
func levelOrder(root *TreeNode) [][]int {
	res := [][]int{}
	if root == nil {
		return res
	}
	queue := []*TreeNode{root}
	for i := 0; len(queue) > 0; i++ {
		res = append(res, []int{})
		temp := []*TreeNode{}
		for j := 0; j < len(queue); j++ {
			node := queue[j]
			res[i] = append(res[i], node.Val)
			if node.Left != nil {
				temp = append(temp, node.Left)
			}
			if node.Right != nil {
				temp = append(temp, node.Right)
			}
		}
		queue = temp
	}
	return res
}


//打印二维数组
func PrintMartrix(res [][]int) {
	for i := 0; i < len(res); i++ {
		fmt.Print("[")
		for j := 0; j < len(res[i]); j++ {
			fmt.Print(" ", res[i][j], " ")
		}
		fmt.Println("]")
	}
}