Pages

Friday, July 4, 2025

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;

}




No comments:

Post a Comment

3917. Count Indices With Opposite Parity (Brute Force) O(n2) + Optimized Solution O(n) + tips LEETCODE WEEKLY 500

  class Solution {     public int [] countOppositeParity ( int [] nums ) {          // approach 1 - checks every pair         int n = n...