en/chapter_heap/build_heap/ #1661
giscus[bot]
bot
Replies: 2 comments
-
|
"""Since nodes are added to the binary tree from top to bottom, the heap is constructed "from top to bottom.". """ Perhaps it means level by level, left to right, hence top to bottom. |
Beta Was this translation helpful? Give feedback.
0 replies
-
|
Are you OK? |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
en/chapter_heap/build_heap/
Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code
https://www.hello-algo.com/en/chapter_heap/build_heap/
Beta Was this translation helpful? Give feedback.
All reactions