my coding journey 2024

Wednesday, July 9, 2025

Virtual Base Class - C++ (OOPs Topic)

class A {
public:
void show() {
cout << "Base Class\n";
} };

class B : virtual public A {};

class C : virtual public B {};

class D : public B, public C {};

-> use virtual in base class inheritance to avoid diamond problem.

Friday, July 4, 2025

isFull() in Linked List in C++

int isFull(Node* top) {

Node* p = new(nothrow) Node; // Safe allocation prevents bad_alloc, include new

if(!p) {

return 1;

} else {

delete p;

return 0;

}

isEmpty() in Linked List in C++

int isEmpty(Node* top) {
return (top == NULL); // return (!top);

}

Implementation of Stack using Linked LIst in C++

#include <iostream>
#include <cstdlib>
using namespace std;

struct Node {
    int data;
    Node* next;
};

Node* top = NULL; // Global stack top pointer

void linkedListTraversal(Node* ptr) {
    while (ptr) { // Fixed: Correct loop condition
        cout << "Element: " << ptr->data << endl;
        ptr = ptr->next;
    }
}

int isEmpty(Node* top) {
    return (!top); 
}

int isFull(Node* top) {
    Node* p = (Node*) malloc(sizeof(Node));
    if (!p) {
        return 1; // Stack is full (memory can't be allocated)
    } else {
        free(p);
        return 0;
    }
}

Node* push(Node* top, int x) {
    Node* n = new Node;
    if (!n) {
        cout << "Stack Overflow" << endl;
        return top;
    }

    n->data = x;
    n->next = top;
    top = n;

    return top;
}

int pop() {
    if (isEmpty(top)) {
        cout << "Stack Underflow" << endl;
        return -1;
    } else {
        Node* n = top;
        int x = n->data;
        top = top->next;
        free(n); // You used malloc in isFull(), so free() is OK here
        return x;
    }
}

int main() {
    top = push(top, 78);
    top = push(top, 7);
    top = push(top, 8);

    int element = pop();
    cout << "Popped element: " << element << endl;

    linkedListTraversal(top);

    return 0;
}

Push() in Linked List in C++

Node* push(Node* top, int x) {

Node* n = new Node; // Memory allocation

if (!n) { // or (n == NULL)

cout << "Stack overflow" << endl;

return top;

}

n->data = x;

n->next = top;

top = n;

return top;

}

Pop() in Linked List in C++

int pop() {

if(isEmpty(top))
{

cout << "Stack underflow << endl;

return -1;

}

else

{

Node* n = top;

int x = n->data;

top=top->next;

free(n);

return x;

}
}

Linked List Traversal in C++

void linkedListTraversal(Node* ptr) {
while (ptr != NULL) {

cout << " Element : " << ptr->data << endl;
ptr = ptr->next;
}

}

It travels across the LinkedList and prints all the elements.