- 例如把[3,9,20,null,null,15,7]这种形式的数组或list中的null改成-1,即[3,9,20,-1,-1,15,7]
- 把[3,9,20,-1,-1,15,7]传入方法即可转换成二叉树,并返回其根节点
-
Notifications
You must be signed in to change notification settings - Fork 0
fjddhd/heapArrayToTreeNode
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
以ArrayList或Array存储的堆转二叉树
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published