What do you want to save?
Add Code snippet
New code examples
-
C++ 2021-11-13 01:16:11
heap sort heapify and max heap in binary tree
Implementation of heap sort in C: #include <stdio.h> int main() { int heap[10], array_size, i, j, c, root, temporary; printf("\n Enter size of array to be sorted :"); scanf("%d", &array_size); printf("\n Ent... Add solution -
C++ 2021-10-28 02:21:11
heap sort internal implementation using c++
Implementation of heap sort in C: #include <stdio.h> int main() { int heap[10], array_size, i, j, c, root, temporary; printf("\n Enter size of array to be sorted :"); scanf("%d", &array_size); printf("\n Ent... Add solution -
Other 2021-10-27 13:27:10
full tree vs complete tree
Full v.s. Complete Binary Trees. A full binary tree (sometimes proper binary tree or 2-tree) is a tree in which every node other than the leaves has two children. A complete binary tree is a binary tree in which every level, except possibly the last, is ... Add solution -
TypeScript 2021-10-06 06:15:02
minimum and maximum numbers of elements in a heap of height h
Hence the minimum number of nodes possible in a heap of height h is 2h. Clearly a heap of height h, has the maximum number of elements when its lowest level is completely filled. In this case the heap is a complete binary tree of height h and hence has 2h... Add solution