C++ Template List Implementation

Template-List.cpp

#include <iostream>

template <typename T>
struct Node {
  T data;
  Node *next;
};

template <typename T> class List{
private:
    Node<T> *head;
public:
    List(){
        head = NULL;
    }

    void push(T val){
        Node<T> *n = new Node<T>();   
        n->data = val;             
        n->next = head;        
        head = n;              
    }

    T pop(){
      if(head) {
        T p = head->data;
        head = head->next;
        return p;
      }
    }
    
    bool search(T val) {
      Node<T> *temp = head;
      while(temp->next) {
        if(temp->data == val) return true;
        else temp = temp->next;
      }
      delete temp;
      return false;
    }
};

int main() {
    List<int> list;

    list.push(1);
    list.push(2);
    list.push(3);

    std::cout << list.pop() << std::endl;
    std::cout << list.search(2) << std::endl;
    std::cout << list.pop() << std::endl;

    return 0;
}

I consider that you have a mistake in a 34 line . Your function don't check the last element in the list.