Common Data Structure Manipulation

Heap Manipulation

---

Java

// Create a min-heap
PriorityQueue<Integer> minHeap = new PriorityQueue<>();
 
// Add a new element to the heap
minHeap.add(5);
 
// Remove and return the smallest element from the heap
minHeap.poll();

Python

# # Create a list to serve as a container for the min-heap
minHeap = []
# Convert the list with elements into a min-heap
heapq.heapify(minHeap)
 
# Add a new element to the heap
heapq.heappush(minHeap, 5)
 
# Remove and return the smallest element from the heap
heapq.heappop(minHeap)

C++

// Create a min-heap
priority_queue<int> minHeap;
 
// Add Add a new element to the heap
minHeap.push(5);
 
// Remove the smallest element from the heap
minHeap.pop();
// Return the smallest element from the heap
minHeap.top().val;

Stack Manipulation

---

Java

// Create a stack
Stack<Integer> stack = new Stack<>();
 
// Add a new element to the stack
stack.push(10);
 
// Remove and return the top element from the stack
int topElement = stack.pop();
 
// Return the top element from the stack
int topElement = stack.peek();