Skip to main content
Computer Science

Return to Question

deleted 1 character in body; edited title
Source Link
xskxzr
xskxzr
  • 7.6k
  • 5
  • 23
  • 47

Interesting question If a min heap of Min Heap[n] is stored into an array, what are the minimum and maximum values for an element at a given index?

If we store a min heap of $n$ elements  , $\color{Blue}{[1,2, \dots n]}$ into an array, then what can be minimum value present at any index $i$ and maximum value present at any index $i$. (elements are from $\color{Blue}1$ to $\color{Blue}n$)

Interesting question of Min Heap

If we store a min heap of $n$ elements  , $\color{Blue}{[1,2, \dots n]}$ into an array, then what can be minimum value present at any index $i$ and maximum value present at any index $i$. (elements are from $\color{Blue}1$ to $\color{Blue}n$)

If a min heap of [n] is stored into an array, what are the minimum and maximum values for an element at a given index?

If we store a min heap of $n$ elements, $\color{Blue}{[1,2, \dots n]}$ into an array, then what can be minimum value present at any index $i$ and maximum value present at any index $i$. (elements are from $\color{Blue}1$ to $\color{Blue}n$)

Bumped by Community user
Bumped by Community user
Bumped by Community user
Bumped by Community user
Tweeted twitter.com/StackCompSci/status/826893699980345344
Source Link
user3699192
user3699192
  • 177
  • 2
  • 17

Interesting question of Min Heap

If we store a min heap of $n$ elements , $\color{Blue}{[1,2, \dots n]}$ into an array, then what can be minimum value present at any index $i$ and maximum value present at any index $i$. (elements are from $\color{Blue}1$ to $\color{Blue}n$)