C++ Object Creation & Memory

🔹 1. Object Creation in C++ vs Java

✅ C++

• Objects can be created in two ways:

1. Stack Allocation

queue q;

• Stored in stack memory
• Automatically destroyed when out of scope
• Faster and preferred

---

2. Heap Allocation

queue* q = new queue();
delete q;

• Stored in heap memory
• Must manually free using delete

---

✅ Java

Queue q = new Queue();

• Objects are created only on heap
• new is mandatory
• Memory handled by Garbage Collector

---

🎯 Key Difference

C++ supports both stack & heap allocation → new is optional
Java supports only heap allocation → new is mandatory

---

🔹 2. Stack Memory

📌 Definition

Memory used for:

• Local variables
• Function calls
• Static allocation

---

⚙️ Properties

• ✅ Automatic memory management
• ⚡ Very fast
• 📦 Limited size
• 🔁 Follows LIFO (Last In First Out)
• ⏳ Lifetime = function/block scope

---

✅ Example

int x = 10;
queue q;

---

❌ Problem: Stack Overflow

int arr[10000000]; // too large → crash

---

🔹 3. Heap Memory

📌 Definition

Memory used for:

• Dynamic allocation at runtime

---

⚙️ Properties

• ❗ Manual memory management (new / delete)
• 🐢 Slower than stack
• 📦 Large memory
• ⏳ Lifetime = until deleted
• 🔀 No fixed order

---

✅ Example

queue* q = new queue();
delete q;

---

❌ Problem: Memory Leak

queue* q = new queue();
// forgot delete → memory leak

---

🔹 4. Stack vs Heap (Comparison Table)

Feature	Stack	Heap
Allocation	Automatic	Manual (new/delete)
Speed	Fast	Slower
Size	Limited	Large
Lifetime	Scope-based	Until deleted
Access	Direct	Pointer-based
Management	Compiler	Programmer
Risk	Stack overflow	Memory leak

---

🔹 5. Circular Queue Insight (From Your Code)

📌 Concept

You implemented a circular queue using modulo:

rear = (rear + 1) % 10;
front = (front + 1) % 10;

✅ Why?

• Prevents wasted space
• Reuses freed indices
• Makes array behave like a circle

---

⚙️ Time Complexity

• push() → O(1)
• pop() → O(1)
• top() → O(1)

---

🔹 6. When to Use What?

✅ Use Stack When:

• Small data
• Short lifetime
• High performance needed

---

✅ Use Heap When:

• Large data
• Dynamic size
• Data must persist outside function
• Trees, graphs, linked lists

---

🔹 7. Best Practices (Important 🚀)

✅ Prefer Stack

queue q;

---

⚠️ Use Heap Carefully

queue* q = new queue();
delete q;

---

✅ Modern C++ (Recommended)

Use Smart Pointers instead of raw new:

#include <memory>
auto q = make_unique<queue>();

✔ Prevents memory leaks automatically

---

🔹 8. Common Interview Questions

❓ Why is stack faster than heap?

👉 No overhead of allocation/deallocation (handled by compiler)

---

❓ Why avoid excessive new?

👉 Can cause:

• Memory leaks
• Fragmentation
• Slower performance

---

❓ What is RAII?

👉 Resource Acquisition Is Initialization

• Objects manage their own lifetime automatically

---

🎯 Final One-Liner Summary

Stack is fast, automatic, and scope-based, while heap is flexible, dynamic, and manually managed.