SinglyLinkedList, C#

Language: Layout:

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Node
    {
        public int Value {get; set;}
        public Node Next {get; set;}
            }
    
    public class LinkedList
    {
        private Node head;
    
  public void PrintAllNodes()
  {
  Node current = head;
      while(current!=null){
      Console.WriteLine(current.Value);
          current=current.Next;
          
      }
  
  }
        //counting number of nodes in a linked list
        public  int getCount()
        {
            int count=0;
            Node Current=head;
            while(Current!=null)
            {
                count++;
             Current=Current.Next;
            }
            return count;
        }
        
        // adding node at the end of singly linked list
        public void addNodeEnd(int data)
        {
            Node toAdd= new Node();
            Node temp=new Node();
            toAdd.Value=data;
            toAdd.Next=null;
           
            if(head==null)
            {
                head=toAdd;
            }
            else
            {
                temp=head;
                while(temp.Next!=null)
                {
                    temp=temp.Next;
                }
                
                temp.Next=toAdd;
                            }
            
                     
        
        }
        //Adding node at the beginning of singly Linked List
       public void addFirst(int data)
       {
           Node toAdd= new Node();
           toAdd.Value=data;
           toAdd.Next=head;
           head=toAdd;
       }
        
        
        //Remove element in linked list
        
      public void RemoveElements(int val) {
      if(head != null)
    {
        Node current = head;
     
        while(current !=null && current.Next != null)
        {
       
            if(current.Value == val)
            {
                current.Value = current.Next.Value;
                current.Next = current.Next.Next;
            }
            else
                current = current.Next;
        }

int count = 0;
        Node p = head;
        Node pBefore = null;
        while(p != null)
        {
            if(p.Next != null)
                pBefore = p;
            p = p.Next;
            count++;
                        }

if(current.Value == val)
        {
            if(count == 1)
             head = null;
             else if(count > 1)
                pBefore.Next = null;
        }
      
    }

}
        
        
        
        
}

public class Program
    {
        public static void Main(string[] args)
        {
            //Your code goes here
            LinkedList myList= new LinkedList();
     
            myList.addNodeEnd(2);
          myList.addNodeEnd(3);
            myList.addNodeEnd(6);
             myList.addNodeEnd(4);
             myList.addNodeEnd(5);
             myList.addNodeEnd(6);
            myList.addNodeEnd(6);
             myList.addFirst(66);
         //  System.Console.WriteLine("    Removed "+ myList.RemoveElements(2).Value+"****");
            
            myList.RemoveElements(2);
          System.Console.WriteLine("Count "+  myList.getCount());
          //   myList.addFirst(5);
          //   myList.addFirst(6);
            myList.PrintAllNodes();
        }
    }

}

Show compiler warnings [ + ] Show input
Compilation time: 0,14 sec, absolute running time: 0,09 sec, cpu time: 0,08 sec, average memory usage: 15 Mb, average nr of threads: 3