golang刷leetcode 技巧（73） 特定深度节点链表

/**
 * Definition for a binary tree node.
 * type TreeNode struct {
 *     Val int
 *     Left *TreeNode
 *     Right *TreeNode
 * }
 */
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */
func listOfDepth(tree *TreeNode) []*ListNode {
    var q1,q2 queue
    if tree==nil{
        return nil
    } 
    var r []*ListNode
    q1.push(tree)
    head:=new(ListNode)
    for !q1.empty() || !q2.empty(){
        cur:=head
        for !q1.empty(){
            x:=q1.pop()
            if x.Left!=nil{
                q2.push(x.Left)
            }
            if x.Right!=nil{
                q2.push(x.Right)
            }
            cur.Next=&ListNode{
              Val:x.Val,
            }
            cur=cur.Next
        }
        r=append(r,head.Next)
        head.Next=nil
        for !q2.empty(){
            q1.push(q2.pop())
        }
    }
    return r
}

type queue struct{
    data []*TreeNode
}

func(this*queue)push(t*TreeNode){
   this.data=append(this.data,t)
}

func (this*queue)empty()bool{
    return len(this.data)<1
}

func (this*queue)pop()*TreeNode{
    if this.empty(){
        return nil
    }
    x:=this.data[0]
    this.data=this.data[1:]
    return x
}