Ted 帶你學習數據結構 之 二叉堆(Binary Heap)

二叉堆(Binary Heap) (1)structure property Heap(堆)是一個除了底層節點外的完全填滿的二叉樹,底層可以不完全,左到右填充節點。(a heap is a binary tree that completely filled, with the exception of bottom level, which is filled from left to righ
相關文章
相關標籤/搜索