hotamul의 개발 이야기

[Data Structure][C++] Heap (Min Heap) 본문

myt-algorithm-practice/Samsung SW Certi Pro

[Data Structure][C++] Heap (Min Heap)

hotamul 2021. 11. 23. 18:26

Definition of Min Heap

  • Complete Binary Tree
  • The value of Parent <= The value of Child

https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcSnOskp0-ZI2-EW5uy2BWXFM707kzbG-lVCT03EBY6kVCUHxAc_TeDlPHIprt-F16Ol5Nw&usqp=CAU

 

Method

  • Push(x) : push a element x to heap
  • Pop() : remove the smallest element from heap
  • Top() : return the smallest element from heap

 

Implement

  • Parent Index : i / 2
  • Left Child Index : i * 2
  • Right Child Index : i * 2 + 1

 

https://www.geeksforgeeks.org/wp-content/uploads/binaryheap.png

 

'myt-algorithm-practice > Samsung SW Certi Pro' 카테고리의 다른 글

[Algorithm][C++] BOJ 10825: 국영수 (Priority Queue, Heap)  (0) 2021.11.25
[Algorithm][C++] BOJ 1764: 듣보잡 (Hash Table + Merge Sort)  (0) 2021.11.23
[Data Structure][C++] Hash Table  (0) 2021.11.22
[Algorithm][C++] BOJ 1620: 나는야 포켓몬 마스터 이다솜 (Hash Table - Chaining (Single Linked List)  (0) 2021.11.22
[Algorithm][C++] BOJ 3190: 뱀 (Double Linked List)  (0) 2021.11.21
'myt-algorithm-practice/Samsung SW Certi Pro' Related Articles more
Comments