(Linked list )Can someone complete the code

Question

using System;
namespace DataStructures
{
class SkeletonLinkedList<T> where T : IComparable<T>
{
private Node head;
private int length = 0;

private class Node
{
public Node(T data) { this.data = data; }
public T data;
public Node next, prev;
}
public int Length { get { return length; } }

public void Add(T data)
{

}
public T Get(int index)
{

}
public bool Contains(T data)
{

}
public void Clear()
{

}
public void Remove(T data)
{

}
public void RemoveAt(int index)
{

}
public void Sort()
{

}
public void Display()
{

}
} }

Answer 1

Why are you write rough code? In your code, you don't mention escape sequence(\n) and Semicolon. without these, you don't run your codes never.

Answer 2

Ravi Prakash Kumawat my code is missing the Add function and remove and Get i need to write some code in these functions to make it works