关于堆数据结构的问题 [英] Question on heap data structure

问题描述

您好

我正在准备网络考试

有一个关于数据结构的问题



问题是从1,2,3,4,5值可以形成多少分钟堆？



向我提供正确的解释。



我尝试了什么：



我尝试在谷歌搜索但没有得到完美答案我看过很多视频，但它没有帮助我。

Hello
I am preparing for the net exam
There is one question regarding data structure

Question is how many min heaps can be formed from values 1,2,3,4,5 ?

Provide me ans with proper explanation.

What I have tried:

I tried searching on the google but did not get perfect answer I seen many videos but it not helped me.

推荐答案

如果您在Google上找到的结果对您没有帮助，那么我们无法在小文字框：可以从值1,2,3,4,5形成多少分钟堆积 - Google搜索 [ ^ ]

我建议你回到谷歌搜索结果，并阅读一些链接仔细：将它与课程结合起来，你应该能够解决这个问题。

If the results you find on Google don't help you, then we can't explain any better in a little text box: how many min heaps can be formed from values 1,2,3,4,5 - Google Search[^]
I'd suggest you go back to the Google results, and read some of the links carefully: combine that with your coursework and you should be able to work it out.

这篇关于关于堆数据结构的问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！