Code Pumpkin

Tag Archives: DataStructure

Heap (Min/Max Heap)

March 31, 2017
Posted by Dipen Adroja

What is heap? Heap is a balanced binary tree data strucure where the root-node key is compared with its children and arranged accordingly. Max Heap: Root element will always be greater than or equal to either of its child element( see the image on left pane). Min Heap: Root element will always be less than or equal […]

Linked List

March 31, 2017
Posted by Dipen Adroja

A linked list is a dynamic data structure which is consist of nodes and links. The number of nodes in a list is not fixed and can grow and shrink on demand. As Discussed in previous article of ArrayList, this structure will provide us more space effective insertion/deletion for intermediate elements. In this structure it will […]

Array List

March 31, 2017
Posted by Dipen Adroja

We can think, arraylist as an array having collection of items which can grow and shrink dynamically. Before going further one question should arise Why we want to use array list instead of array? Answer is very simple, when we need a data structure which have all the array capabilities and is also efficient at […]

Next posts
Total Posts : 106
follow us in feedly
Contribute Your Articles

Subscribe Us

Like Us On Facebook