啃书啃到头疼了，呼叫兄弟们帮吗！
看关于算法的书讲到数据结构中的堆，因此我联想到了内存中的堆，这两种有联系吗？如果有，又是什么关系呢？
有可能是因为这个问题比较晦涩，在网上翻了半天没找到想要的答案，找兄弟们帮忙。

自己顶

先看看定义呀，一头扎进细节中，就会这样。

T版啊，你直接告诉我答案吧，这就是一个疑惑，也不涉及到知识的延伸什么的，解开了知道了就拉倒了，我也没打算研究它 啊

两个不相关的概念，称呼相同罢了。

heap  
n.

1.A portion of memory reserved for a program to use for the temporary storage of data structures whose existence or size cannot be determined until the program is running. To build and use such elements, programming languages such as C and Pascal include functions and procedures for requesting free memory from the heap, accessing it, and freeing it when it is no longer needed. In contrast to stack memory, heap memory blocks are not freed in reverse of the order in which they were allocated, so free blocks may be interspersed with blocks that are in use. As the program continues running, the blocks may have to be moved around so that small free blocks can be merged together into larger ones to meet the program’s needs. See also garbage collection. Compare stack.

2. A complete binary tree in which the value of any node is not exceeded by the value of either of its children. See also binary tree.

T版欺负人，4级还没过呢

我的理解就是，堆的内存比栈大，在函数执行完后，不会释放

虽然看着很费劲，但是大概懂了，难道堆只有在C和帕斯卡里才有吗》？？

告诉你哥办法，联想，把你能看懂的部分和你已将知道的相关知识放在一起猜着读

一个是内存管理中的概念，一个是数据结构中的二叉树，两者之间没有关系，纯粹占用了同样的字母组合而已。

哈哈，这就懂了，谢谢啊