goden0403

package

v0.0.0-...-b071cee Latest Latest Go to latest Published: Aug 9, 2023 License: GPL-3.0 Imports: 2 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/CodeHanHan/leetcode-go

Links

Open Source Insights

README ¶

面试题 04.03.特定深度节点链表

1. 题目描述

给定一棵二叉树，设计一个算法，创建含有某一深度上所有节点的链表（比如，若一棵树的深度为 D ，则会创建出 D 个链表）。返回一个包含所有深度的链表的数组。

示例：

输入：[1,2,3,4,5,null,7,8]

        1
       /  \ 
      2    3
     / \    \ 
    4   5    7
   /
  8

输出：[[1],[2,3],[4,5,7],[8]]

标签 树 广度优先搜索 链表 二叉树

2. 解题

Documentation ¶

Index ¶

type ListNode
type TreeNode
- func BuildTree(preorder []int, inorder []int) *TreeNode

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type ListNode ¶

type ListNode struct {
	Val  int
	Next *ListNode
}

func BuildCircleListWithNoHead ¶

func BuildCircleListWithNoHead(list []int, cursor int) *ListNode

BuildCircleListWithNoHead build a circle list, which tail point to list[cursor]

func BuildListWithHead ¶

func BuildListWithHead(data []int) *ListNode

func BuildListWithNoHead ¶

func BuildListWithNoHead(nums []int) *ListNode

func (*ListNode) HasCycle ¶

func (l *ListNode) HasCycle() (bool, *ListNode)

HasCycle check if linklist has cycle structure, if not, return false, nil, if yes, return true and the cycle start node

func (*ListNode) Index ¶

func (l *ListNode) Index(target int) *ListNode

Index return the node which value equals target

func (*ListNode) Len ¶

func (l *ListNode) Len() int

Len return list length, when list has cycle structure, return -1

func (*ListNode) Slice ¶

func (l *ListNode) Slice() []int

Slice return slice which contains all node's values in order.

func (*ListNode) String ¶

func (l *ListNode) String() string

String implements Stringer interface.

func (*ListNode) Tail ¶

func (l *ListNode) Tail() *ListNode

Tail return last list node

type TreeNode ¶

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

func BuildTree ¶

func BuildTree(preorder []int, inorder []int) *TreeNode

func (*TreeNode) InOrder ¶

func (root *TreeNode) InOrder(Visit func(val int))

func (*TreeNode) PostOrder ¶

func (root *TreeNode) PostOrder(Visit func(val int))

func (*TreeNode) PreOrder ¶

func (root *TreeNode) PreOrder(Visit func(val int))

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL