2. type ListNode struct {
    3.     Val  int
    4.     Next *ListNode
    5. }
    7. func reverselist(head *ListNode) *ListNode {
    8.     var temp *ListNode
    9.     pre := head
    10.     for pre != nil {
    11.         t := pre.Next
    12.         pre.Next = temp
    13.         temp = pre
    14.         pre = t
    15.     }
    16.     return temp
    17. }
    19. type NodeTree struct {
    20.     Val   int
    21.     Left  *NodeTree
    22.     Right *NodeTree
    23. }
    25. func levelOrder(node *NodeTree) (res [][]int) {
    26.     res = [][]int{}
    27.     if node == nil {
    28.         return
    29.     }
    30.     queue := []*NodeTree{node}
    31.     for len(queue) > 0 {
    32.         //创建临时队列,保存层节点
    33.         tmpQ := []*NodeTree{}
    34.         tmpRes := []int{}
    35.         for j := 0; j < len(queue); j++ {
    36.             node := queue[j]
    37.             tmpRes = append(tmpRes, node.Val)
    38.             if node.Right != nil {
    39.                 tmpQ = append(tmpQ, node.Right)
    40.             }
    41.             if node.Left != nil {
    42.                 tmpQ = append(tmpQ, node.Left)
    43.             }
    44.         }
    45.         //处理下一层
    46.         queue = tmpQ
    47.         res = append(res, tmpRes)
    48.     }
    49.     return
    50. }