C# Online Compiler | .NET Fiddle

<no name> by Anonymous

using System;
					
public class Program
{
	
	public static  BinNode<int> DeleteNode1 (BinNode<int> bnlist,BinNode<int> posDel)
	{
		if (posDel==bnlist)
		{
            bnlist = bnlist.GetRight();
			bnlist.SetLeft(null);
			posDel.SetRight(null);
			//Console.WriteLine(bnlist.ToString());
		}
		else
		{
            BinNode<int> p1 = posDel.GetLeft();
			BinNode<int> p2 = posDel.GetRight();
			p1.SetRight(p2);
			p2.SetLeft(p1);
			posDel.SetRight(null);
			posDel.SetLeft(null);
			//Console.WriteLine(bnlist.ToString());
		} 
		return bnlist;
	}
	
	
	
	
	
	
	
	
	public static  void DeleteNode (BinNode<int> bnlist,BinNode<int> posDel)
	{
		if (posDel==bnlist)
		{
            bnlist = bnlist.GetRight();
			bnlist.SetLeft(null);
			posDel.SetRight(null);
			Console.WriteLine(bnlist.ToString());
		}
		else
		{
            BinNode<int> p1 = posDel.GetLeft();
			BinNode<int> p2 = posDel.GetRight();
			p1.SetRight(p2);
			p2.SetLeft(p1);
			posDel.SetRight(null);
			posDel.SetLeft(null);
			Console.WriteLine(bnlist.ToString());
		}      
	}
	
	public static BinNode<int> BuildBnlistInt ()
	{
        BinNode<int> duList = new BinNode<int> (int.Parse(Console.ReadLine()));
		BinNode<int> last = duList;
		int num = int.Parse(Console.ReadLine());
		while (num!=-999)
		{
            BinNode<int> p = new BinNode<int> (num);
			last.SetRight(p);
			p.SetLeft(last);
			last=last.GetRight();
			num = int.Parse(Console.ReadLine());
		}
		return duList;
	}

	public static BinNode<string> BuildBnlistStr ()
	{
        BinNode<string> duList = new BinNode<string> (Console.ReadLine());
		BinNode<string> last = duList;
		string num = Console.ReadLine();
		while (num!="#")
		{
            BinNode<string> p = new BinNode<string> (num);
			last.SetRight(p);
			p.SetLeft(last);
			last=last.GetRight();
			num = Console.ReadLine();
		}
		return duList;
	}
	
	
	
	
		public static void PrintReverse (BinNode<int> bnlist)
	    {
			BinNode<int> p = bnlist;
			while (p.HasRight())
				p=p.GetRight();
		    while (p!=bnlist)
			{
                Console.Write(p.GetValue()+" ");
			    p=p.GetLeft();
			}
	        Console.Write(p.GetValue()+" ");
		}
    

	public static void Show (Node<Student> lst)
{
   Console.Write("[");
	Node<Student> pos = lst;

while (pos != null)
	{
Console.Write(pos.ToString());
		if (pos.HasNext())
			Console.Write(", ");
		pos = pos.GetNext();
	}
	Console.WriteLine("]");
 }

	
	public static void ShowBnlist (BinNode<int> lst)
{
   Console.Write("[");
	BinNode<int> pos = lst;

while (pos != null)
	{
        Console.Write(pos.ToString());
		//if (pos.HasRight())
			//Console.Write(", ");
		pos = pos.GetRight();
	}
	Console.WriteLine("]");
 }

	

	
	
	
	
	
	public static  BinNode<int> RemoveProduct (BinNode<int> bnlist,int product)
	{
	
			
		BinNode<int> posDel = bnlist;
		while(posDel.HasRight() && posDel.GetValue()!=product)
        {
                posDel = posDel.GetRight();
        }
		
		if (posDel==bnlist)
		{
            bnlist = bnlist.GetRight();
			bnlist.SetLeft(null);
			posDel.SetRight(null);
			//Console.WriteLine(bnlist.ToString());
		}
		else
		{
            BinNode<int> p1 = posDel.GetLeft();
			BinNode<int> p2 = posDel.GetRight();
			p1.SetRight(p2);
			p2.SetLeft(p1);
			posDel.SetRight(null);
			posDel.SetLeft(null);
			//Console.WriteLine(bnlist.ToString());
		} 
		return bnlist;
	}
	
	//assumptin:
	public static BinNode<string> RemoveProduct111 (BinNode<string> bnlist,string product)
	{
     	if (product.Equals("") || bnlist==null) 
		{
            Console.WriteLine("error");
			return bnlist;
		}	
		            
		
		BinNode<string> pos = bnlist;
		
		while(pos.HasRight() && !pos.GetValue().Equals(product))
            {
                pos = pos.GetRight();
            }
            
		if (pos.GetValue().Equals(product) && pos==bnlist && !pos.HasRight()) //the list contains one item
			bnlist=null;
		
		else if (pos.GetValue().Equals(product) && pos==bnlist && pos.HasRight())
		{
			bnlist = bnlist.GetRight();
			bnlist.SetLeft(null);
			pos.SetRight(null);
		}
		
		else if (pos.GetValue().Equals(product) && pos!=bnlist && pos.HasRight())
		{
            BinNode<string> p1 = pos.GetLeft();
			BinNode<string> p2 = pos.GetRight();
			p1.SetRight(p2);
			p2.SetLeft(p1);
			pos.SetRight(null);
			pos.SetLeft(null);
		}
		
		else if (pos.GetValue().Equals(product) && pos!=bnlist && !pos.HasRight()) //the item is in the end of the list
		{
            BinNode<string> temp = pos.GetLeft();
			temp.SetRight(null);
			pos.SetRight(null);
			pos.SetLeft(null);
		}
		
         else
			 Console.WriteLine("error. the product does not exists");
         return bnlist;
	}
	
	
	
	public static void Main()
	{
		//BinNode<int> first = new BinNode<int>(5);
	   // BinNode<int> last = first;
		//BinNode<int> pos = first;
	 //  last.SetRight(new BinNode<int>(last,3,null));
	//   last = last.GetRight();
	  //  last.SetRight(new BinNode<int>(last,8,null));
	 //  last = last.GetRight();
      //  ShowBnlist(first); // 5 ⇆ 3 ⇆ 8 -->
		//ShowBnlist(DeleteNode1(first,last));
	   // last.GetLeft().SetRight(new BinNode<int>(last.GetLeft(),4,last));
		//last.GetLeft().SetRight(new BinNode<string>(last.GetLeft(),"d",last));
	  //  last.SetLeft(last.GetLeft().GetRight());
	  //  Console.WriteLine(first); // 5 ⇆ 3 ⇆ 4 ⇆ 8 -->
		//Console.WriteLine("***");
		//Console.WriteLine(RemoveProduct(first,"b").ToString());
		
	
		
		//Console.WriteLine(BuildBilist().ToString());//correct
	//	PrintReverse(BuildBilist());//correct
	//BinNode<string> list = BuildBnlistStr();
			//ShowBnlist (RemoveProduct111(list,"x"));
           
		//	else
		      //  Console.WriteLine(RemoveProduct111(list,"x").ToString());
	//BinNode<string> list = BuildBnlistStr();
		//ShowBnlist(RemoveProduct111(list,"x"));
		//BinNode<string> pos = null;
	//	BinNode<string> list = BuildBnlistStr();
	//	string s = Console.ReadLine();
		//ShowBnlist(RemoveProduct111(list,s));
		
		
		Item t = new Item();
		t.Insert(3);
		t.Insert(1);
		t.Insert(8);
		t.Insert(7);
		t.Insert(5);
		t.Insert(10);
		Console.WriteLine(t.ToString());
		Console.WriteLine("min="+t.ShowMin());
		Console.WriteLine("max="+t.GetMax());
		Console.WriteLine(t.ToString());
		Console.WriteLine(t.ExistX(3));
		Console.WriteLine(t.IsExist7Boom());
	}
}

public class Item
{
    private BinNode<int> bnlist;
	private int min;
	private int max;

    public Item()
    {
        bnlist = null;
		min = int.MaxValue;
		max = int.MinValue;
    }

	public BinNode<int> GetBnlist ()
	{
        return this.bnlist;
	}
	
	
    public void Insert (int x)
    {
        BinNode<int> tmp = this.bnlist;
        if (tmp == null)
        {
            bnlist = new BinNode<int>(x);
			this.min = x;
			this.max = x;
        }
        else
        {
			while (tmp.HasRight())
                tmp = tmp.GetRight();
            BinNode<int> p = new BinNode<int> (x);
			tmp.SetRight(p);
			p.SetLeft(tmp);
			tmp=tmp.GetRight();
			if (x>this.max) this.max = x;
			if (x<this.min) this.min = x;
		}		   
	}
  
	public int ShowMin ()
	{
         return this.min;
	}
	
	//assumption: the list is not empty
    public int GetMax()
    {
		BinNode<int> pos = bnlist;
        BinNode<int> posDel = bnlist;
		
		while (pos!=null)
		{
            if (pos.GetValue() == this.max)
				posDel = pos;
			pos = pos.GetRight();
		}
		if (posDel==bnlist && bnlist!=null && !posDel.HasRight())
			bnlist=null;
		else if (posDel==bnlist && bnlist!=null && posDel.HasRight())
		{
            bnlist = bnlist.GetRight();
			bnlist.SetLeft(null);
			posDel.SetRight(null);
		}
		else if (posDel!=bnlist && posDel.HasRight())
		{
            BinNode<int> p1 = posDel.GetLeft();
			BinNode<int> p2 = posDel.GetRight();
			p1.SetRight(p2);
			p2.SetLeft(p1);
			posDel.SetRight(null);
			posDel.SetLeft(null);
		}  
		else if (posDel!=bnlist && !posDel.HasRight())
		{
            BinNode<int> temp = posDel.GetLeft();
			temp.SetRight(null);
			posDel.SetRight(null);
			posDel.SetLeft(null);
		}
		return this.max;
    }
	
	public bool ExistX (int x)
	{
        BinNode<int> pos = bnlist;
		while (pos!=null)
		{
            if (pos.GetValue() == x)
				return true;
			pos = pos.GetRight();
		}
		return false;
	}
	
    public bool IsExist7Boom()
	{
        BinNode<int> pos = bnlist;
		while (pos!=null)
		{
            if (pos.GetValue()%7==0)
				return true;
			pos = pos.GetRight();
		}
		return false;
	}
	
	
	public override string ToString ()
	{
		string txt = "[";
	    BinNode<int> pos = this.bnlist;

        while (pos != null)
	    {
            txt = txt + pos.ToString();
		    pos = pos.GetRight();
    	}
	   
		txt = txt + "]";
		txt = txt + "\n" + "min=" + this.min + ", max=" + this.max;
		return txt;
	}
	
	
}




public class BinNode<T>
{
	private T value;             
	private BinNode<T> left;     
	private BinNode<T> right;
	
	public BinNode (T x)
	{
		this.value = x;
		this.left = null;
		this.right = null;
	}
	
	public BinNode (BinNode<T> left, T x, BinNode<T> right)
	{
		this.value = x;
		this.left = left;
		this.right = right;
	}
	
	public T GetValue()
	{
		return this.value;
	}
	
	public BinNode<T> GetLeft()
	{
		return this.left;
	}
	
	public BinNode<T> GetRight()
	{
		return this.right;
	}
	
	public bool HasLeft()
	{
		if (this.left!=null) 
			return true;
		return false;
	}
	
	public bool HasRight()
	{
		if (this.right!=null) 
			return true;
		return false;
	}
	
	public void SetValue(T x)
	{
		this.value = x;
	}
	
	public void SetLeft(BinNode<T> left)
	{
		this.left = left;
	}
	
	public void SetRight(BinNode<T> right)
	{
		this.right = right;
	}
	
	public override String ToString ()
	{
		//return "("+left+" "+value+" "+right+")";
		/*if (value == null)
	        return "null";
	     if (GetRight() != null)
		 
	        return value + " --> " + GetRight().ToString();
	      else
	        return value + " -->";*/
		
	     if (GetRight() != null)
		 
	        return value + " <=> " ;//+ GetRight().ToString();
	      else
	        return value+"";
	}
	
}





public class BusRoute 
{
	private Node<Station> path;
	
	public BusRoute (Station first, Station second)
	{
		this.path = new Node<Station> (second);
		this.path = new Node<Station> (first,this.path); 
		//this.path = new Node<Station> (first);
		//this.path.SetNext(new Node<Station> (second));
	}
	
	public void AddStation (Station newStation)
	{
		Node<Station> p = null;
		Node<Station> pos = this.path;
		while (pos!=null)
		{
			p=pos;
			pos=pos.GetNext();
		}
		p.SetNext(new Node<Station> (newStation));
	}
	public double RouteLength()
	{
		double len=0;
		Node<Station> pos=this.path;
		if (pos==null)
			return 0;
		while (pos.GetNext()!=null)
		{
			len=len+pos.GetInfo().Distance(pos.GetNext().GetInfo());
			pos=pos.GetNext();
		}
		return len;
	}
	
	public Node<Station> GetPath ()
	{
		return this.path;
	}
	
	public void SetPath (Node<Station> p)
	{
		this.path = p;
	}
	
	
	public override String ToString()
	{
		string str=this.path.ToString();
		Node<Station> pos=this.path.GetNext();
		while (pos!=null)
		{
			str = str+"-->"+pos.GetInfo().ToString();
			pos=pos.GetNext();
		}
		return str;
	}
}


public class BirthdaysSchool
{
    private Node<Student> [] ar;
    private const int SIZE = 6; //size of array
	
	public BirthdaysSchool (Node<Student> [] ar)
	{
		this.ar = ar;
		for (int i=0;i<SIZE;i++)
		{
            this.ar[i] = ar[i];
		}
	}
	
	public BirthdaysSchool ()
	{
		this.ar = new Node<Student>[SIZE];
		for (int i=0;i<SIZE;i++)
		{
            this.ar[i] = new Node<Student> (new Student ());
		}
	}

	public Node<Student>[] GetAr ()
	{
		return this.ar;
	}
	
	public void SetAr (Node<Student>[] ar)
	{
		this.ar = ar;
	}
	public override String ToString()
	{
        string str="";
		string text="";
		Node<Student> pos;
		for (int i=0;i<SIZE;i++)
		{
     		str=this.ar[i].ToString();
		    pos=this.ar[i].GetNext();
		    while (pos!=null)
		    {
			   str = str+"-->"+pos.GetInfo().ToString();
			   pos=pos.GetNext();
	     	}
			text = text + str + "\n";
		}
		return text;
	}
}



public class Student 
{
	private string name;    
	private Birth birthDay; 
	
	public Student (string name, Birth birthday)
	{
		this.name=name;
		this.birthDay=birthday;
	}
	
	public Student ()
	{
		this.name=null;
		this.birthDay=new Birth();
	}
	
	public string GetName ()
	{
		return this.name;
	}
	
	public Birth GetBirthDay ()
	{
		return this.birthDay;
	}
	
	public void SetBirthDay (Birth birthDay)
	{
		this.birthDay = birthDay;
	}
	
	
public void SetName (string name)
	{
        this.name = name;
	}
	
	public override String ToString()
	{
		return "name = " + this.name + " birthday = " + this.birthDay.ToString();
	}
}






public class Birth 
{
	private int day;    //day 1-31
	private int month;  //month 1-12
	private int year;   //year
	
	public Birth (int day, int month, int year)
	{
		this.day=day;
		this.month=month;
		this.year = year;
	}
	
	public Birth ()
	{
		this.day = 0;
		this.month = 0;
		this.year = 0;
	}
	
	public int GetDay ()
	{
		return this.day;
	}
	
	public int GetMonth ()
	{
		return this.month;
	}
	
	public int GetYear ()
	{
		return this.year;
	}
	
	public void SetDay (int day)
	{
        this.day = day;
	}
	
	public void SetMonth (int month)
	{
        this.month = month;
	}
	
	public void SetYear (int year)
	{
        this.year = year;
	}
	
	public override String ToString()
	{
		return this.day + "/" + this.month + "/" + this.year;
	}
}







public class Station 
{
	private int x;
	private int y;
	
	public Station (int x,int y)
	{
		this.x=x;
		this.y=y;
	}
	
	public int GetX ()
	{
		return this.x;
	}
	
	public int GetY ()
	{
		return this.y;
	}
	
	public void SetX (int x)
	{
        this.x = x;
	}
	public void SetY (int y)
	{
        this.y = y;
	}
	
	
	public double Distance (Station other)
	{
		double dis;
		dis=Math.Sqrt(Math.Pow((double)(this.x-other.x), 2.0)+Math.Pow((double)(this.y-other.y), 2.0));
        return dis;
	}
	
	public override String ToString()
	{
		return "("+this.x+","+this.y+")";
	}
}






public class Collec 
{
    private Node<int> first;
    private int max;

    public Collec() 
	{
        this.first = null;
        this.max = 0;
    }

    public Collec(int n)
    {
        if (this.first==null)
           this.max = n;
        this.first = new Node<int>(n); 
	}

	
	
	
    public bool Add(int n)
    {
        if (n <= max ) 
			return false;
        else
        {
            if (this.first == null)
                 this.first = new Node<int>(n);
			else
                 this.first.SetNext(new Node<int>(n, first.GetNext()));
		}
        return true;
    }
              
    public int Small()
    {
         Node<int> pos = this.first; 
		 int min = int.MaxValue; 
		 while (pos != null)
         {
              if (pos.GetInfo() < min) 
				  min = pos.GetInfo();
              pos = pos.GetNext(); 
		 }
         return min; 
	}

    public int Smallest(Collec c)
    {
        return Math.Min(Small(), c.Small());
    }
	
	public Node<int> GetFirst ()
	{
        return this.first;
	}
	
	public void SetFirst (Node<int> first)
	{
        this.first = first;
	}
	
	public int GetMax ()
	{
        return this.max;
	}
	
	public void SetMax (int max)
	{
        this.max = max;
	}
	
	
	public override string ToString ()
	{
		string text = "[";
        Node<int> pos = this.first;

       while (pos != null)
	   {
           text = text + pos.ToString();
		   if (pos.HasNext())
			   text = text + ", ";
		   pos = pos.GetNext();
	   }
		
	    text = text + "]";
		return text;
	 }
	
	
	
}




public class Competitor
{
    private int minutes;
    private int seconds;
	private string name;

    public Competitor (int minutes, int seconds, string name)
	{
        this.minutes = minutes;
		this.seconds = seconds;
		this.name = name;
	}

	public bool IsFaster (Competitor c)
	{
        if ( (this.minutes*60 + this.seconds) < (c.minutes*60 + c.seconds) )
			return true;
		return false;
	}
	
    public int GetMinutes ()
	{
        return this.minutes;
	}
	
	public int GetSeconds ()
	{
        return this.seconds;
	}
	
	public string GetName ()
	{
        return this.name;
	}
	
	public void SetMinutes (int minutes)
	{
        this.minutes = minutes;
	}
	
	public void SetSeconds (int seconds)
	{
        this.seconds = seconds;
	}
	
	public void SetName (string name)
	{
        this.name = name;
	}
	
	public override string ToString()
	{
        return "minutes = " + this.minutes + ", seconds = " + this.seconds + ", name = " + this.name + "\n";
	}
}


public class Race
{
    private Node<Competitor> first;
	
	public Race ()
	{
        this.first=null;
	}
	
	public void Add (Competitor c)
	{
        Node<Competitor> pos = this.first;
		Node<Competitor> prev = null;
		
		while (pos!=null && pos.GetInfo().IsFaster(c))
		{
            prev = pos;
			pos = pos.GetNext();
		}
		
		if (prev==null)
			this.first = new Node<Competitor>(c,this.first);
		else
			prev.SetNext(new Node<Competitor>(c,pos));
	}
	
	
	public string Rank (int x)
	{
        Node<Competitor> pos = this.first;
        for (int i=1; pos!=null && i<x; i++)
			pos = pos.GetNext();
		if (pos!=null) 
			return pos.GetInfo().GetName();
		return "not exist";
	}
	
	
	public Node<Competitor> GetFirst ()
	{
        return this.first;
	}
	
	public void SetFirst (Node<Competitor> first)
	{
        this.first = first;
	}
	
	public override string ToString ()
	{
		string text = "[";
        Node<Competitor> pos = this.first;

       while (pos != null)
	   {
           text = text + pos.ToString();
		   if (pos.HasNext())
			   text = text + ", ";
		   pos = pos.GetNext();
	   }
		
	    text = text + "]";
		return text;
	 }
	
}







public class Node<T> 
{
	private T info;
	private Node<T> next;
	
	public Node (T info)
	{
		this.info=info;
		this.next=null;
	}
	public Node (T info, Node<T> next)
	{
		this.info=info;
		this.next=next;
	}
	public T GetInfo()
	{
		return this.info;
	}

public Node<T> GetNext()
	{
		return this.next;
	}
	public void SetInfo(T info)
	{
		this.info=info;
	}
	public void SetNext(Node<T> next)
	{
		this.next=next;
	}

//function that returns true if there is a next node (chulya okevet) 
//aheret returns false
	public bool HasNext()
{
return this.next != null;
}
	
	public override String ToString()
	{
		return this.info+" ";
	}

}




public class Stones
{
    private Node< BiStone > first;
	//private const int MAX=7;
	
	public Stones ()
	{
		this.first = new Node<BiStone> (new BiStone(0,0));
		Node<BiStone> pos = first;
		for (int i=0;i<=6;i++)
		{
            for (int j=10;j<=16;j++)
			{
                pos.SetNext(new Node<BiStone> (new BiStone(i,j)));
				pos = pos.GetNext();
			}
		}
        this.first = this.first.GetNext();			
	}
	
	public Node<BiStone> GetFirst ()
	{
        return this.first;
	}
	
	public void SetFirst (Node<BiStone> first)
	{
        this.first = first;
	}
	
	public override string ToString ()
	{
		string text = "";
        Node<BiStone> pos = this.first;

       while (pos != null)
	   {
           text = text + pos.ToString();
		   if (pos.HasNext())
			   text = text + ", ";
		   pos = pos.GetNext();
	   }
		
	    text = text + "]";
		return text;
	 }
	
}



public class BiStone
{
    private int ones;// מספר חד ספרתי בין 0 ל-6 כולל
    private int tens;// מספר דו ספרתי בין 10 ל-16 כולל


    public BiStone(int ones, int tens)
	{
        this.ones = ones;
		this.tens = tens;
	}
	
	public bool SameDigit()
	{
		if (this.ones == (this.tens%10))
			return true;
        return false;
	}

    public int GetOnes ()
	{
        return this.ones;
	}
	
	public int GetTens ()
	{
        return this.tens;
	}
	
	public void SetOnes (int ones)
	{
        this.ones = ones;
	}
	
	public void SetTens (int tens)
	{
        this.tens = tens;
	}
	
	public override string ToString()
	{
        return "ones digit = " + this.ones + ", tens digit = " + this.tens + "\n";
	}
	
}

​x
 
using System;
                    
public class Program
{
    
    public static  BinNode<int> DeleteNode1 (BinNode<int> bnlist,BinNode<int> posDel)
    {
        if (posDel==bnlist)
        {
            bnlist = bnlist.GetRight();
            bnlist.SetLeft(null);
            posDel.SetRight(null);
            //Console.WriteLine(bnlist.ToString());
        }
        else
        {
            BinNode<int> p1 = posDel.GetLeft();
            BinNode<int> p2 = posDel.GetRight();
            p1.SetRight(p2);
            p2.SetLeft(p1);
            posDel.SetRight(null);
            posDel.SetLeft(null);
            //Console.WriteLine(bnlist.ToString());
        } 
        return bnlist;
    }
    
    
    
    
    
    
    
    
    public static  void DeleteNode (BinNode<int> bnlist,BinNode<int> posDel)
    {
        if (posDel==bnlist)
        {
            bnlist = bnlist.GetRight();
            bnlist.SetLeft(null);
            posDel.SetRight(null);
            Console.WriteLine(bnlist.ToString());
        }
        else
        {
            BinNode<int> p1 = posDel.GetLeft();
            BinNode<int> p2 = posDel.GetRight();
            p1.SetRight(p2);
            p2.SetLeft(p1);
            posDel.SetRight(null);
            posDel.SetLeft(null);
            Console.WriteLine(bnlist.ToString());
        }      
    }
    
    public static BinNode<int> BuildBnlistInt ()
    {
        BinNode<int> duList = new BinNode<int> (int.Parse(Console.ReadLine()));
        BinNode<int> last = duList;
        int num = int.Parse(Console.ReadLine());
        while (num!=-999)
        {
            BinNode<int> p = new BinNode<int> (num);
            last.SetRight(p);
            p.SetLeft(last);
            last=last.GetRight();
            num = int.Parse(Console.ReadLine());
        }
        return duList;
    }
​
    public static BinNode<string> BuildBnlistStr ()
    {
        BinNode<string> duList = new BinNode<string> (Console.ReadLine());
        BinNode<string> last = duList;
        string num = Console.ReadLine();
        while (num!="#")
        {
            BinNode<string> p = new BinNode<string> (num);
            last.SetRight(p);
            p.SetLeft(last);
            last=last.GetRight();
            num = Console.ReadLine();
        }
        return duList;
    }
    
    
    
    
        public static void PrintReverse (BinNode<int> bnlist)
        {
            BinNode<int> p = bnlist;
            while (p.HasRight())
                p=p.GetRight();
            while (p!=bnlist)
            {
                Console.Write(p.GetValue()+" ");
                p=p.GetLeft();
            }
            Console.Write(p.GetValue()+" ");
        }
    
​
    public static void Show (Node<Student> lst)
{
   Console.Write("[");
    Node<Student> pos = lst;
​
while (pos != null)
    {
Console.Write(pos.ToString());
        if (pos.HasNext())
            Console.Write(", ");
        pos = pos.GetNext();
    }
    Console.WriteLine("]");
 }
​
    
    public static void ShowBnlist (BinNode<int> lst)
{
   Console.Write("[");
    BinNode<int> pos = lst;
​
while (pos != null)
    {
        Console.Write(pos.ToString());
        //if (pos.HasRight())
            //Console.Write(", ");
        pos = pos.GetRight();
    }
    Console.WriteLine("]");
 }
​
    
​
    
    
    
    
    
    public static  BinNode<int> RemoveProduct (BinNode<int> bnlist,int product)
    {
    
            
        BinNode<int> posDel = bnlist;
        while(posDel.HasRight() && posDel.GetValue()!=product)
        {
                posDel = posDel.GetRight();
        }
        
        if (posDel==bnlist)
        {
            bnlist = bnlist.GetRight();
            bnlist.SetLeft(null);
            posDel.SetRight(null);
            //Console.WriteLine(bnlist.ToString());
        }
        else
        {
            BinNode<int> p1 = posDel.GetLeft();
            BinNode<int> p2 = posDel.GetRight();
            p1.SetRight(p2);
            p2.SetLeft(p1);
            posDel.SetRight(null);
            posDel.SetLeft(null);
            //Console.WriteLine(bnlist.ToString());
        } 
        return bnlist;
    }
    
    //assumptin:
    public static BinNode<string> RemoveProduct111 (BinNode<string> bnlist,string product)
    {
        if (product.Equals("") || bnlist==null) 
        {
            Console.WriteLine("error");
            return bnlist;
        }   
                    
        
        BinNode<string> pos = bnlist;
        
        while(pos.HasRight() && !pos.GetValue().Equals(product))
            {
                pos = pos.GetRight();
            }
            
        if (pos.GetValue().Equals(product) && pos==bnlist && !pos.HasRight()) //the list contains one item
            bnlist=null;
        
        else if (pos.GetValue().Equals(product) && pos==bnlist && pos.HasRight())
        {
            bnlist = bnlist.GetRight();
            bnlist.SetLeft(null);
            pos.SetRight(null);
        }
        
        else if (pos.GetValue().Equals(product) && pos!=bnlist && pos.HasRight())
        {
            BinNode<string> p1 = pos.GetLeft();
            BinNode<string> p2 = pos.GetRight();
            p1.SetRight(p2);
            p2.SetLeft(p1);
            pos.SetRight(null);
            pos.SetLeft(null);
        }
        
        else if (pos.GetValue().Equals(product) && pos!=bnlist && !pos.HasRight()) //the item is in the end of the list
        {
            BinNode<string> temp = pos.GetLeft();
            temp.SetRight(null);
            pos.SetRight(null);
            pos.SetLeft(null);
        }
        
         else
             Console.WriteLine("error. the product does not exists");
         return bnlist;
    }
    
    
    
    public static void Main()
    {
        //BinNode<int> first = new BinNode<int>(5);
       // BinNode<int> last = first;
        //BinNode<int> pos = first;
     //  last.SetRight(new BinNode<int>(last,3,null));
    //   last = last.GetRight();
      //  last.SetRight(new BinNode<int>(last,8,null));
     //  last = last.GetRight();
      //  ShowBnlist(first); // 5 ⇆ 3 ⇆ 8 -->
        //ShowBnlist(DeleteNode1(first,last));
       // last.GetLeft().SetRight(new BinNode<int>(last.GetLeft(),4,last));
        //last.GetLeft().SetRight(new BinNode<string>(last.GetLeft(),"d",last));
      //  last.SetLeft(last.GetLeft().GetRight());
      //  Console.WriteLine(first); // 5 ⇆ 3 ⇆ 4 ⇆ 8 -->
        //Console.WriteLine("***");
        //Console.WriteLine(RemoveProduct(first,"b").ToString());
        
    
        
        //Console.WriteLine(BuildBilist().ToString());//correct
    //  PrintReverse(BuildBilist());//correct
    //BinNode<string> list = BuildBnlistStr();
            //ShowBnlist (RemoveProduct111(list,"x"));
           
        //  else
              //  Console.WriteLine(RemoveProduct111(list,"x").ToString());
    //BinNode<string> list = BuildBnlistStr();
        //ShowBnlist(RemoveProduct111(list,"x"));
        //BinNode<string> pos = null;
    //  BinNode<string> list = BuildBnlistStr();
    //  string s = Console.ReadLine();
        //ShowBnlist(RemoveProduct111(list,s));
        
        
        Item t = new Item();
        t.Insert(3);
        t.Insert(1);
        t.Insert(8);
        t.Insert(7);
        t.Insert(5);
        t.Insert(10);
        Console.WriteLine(t.ToString());
        Console.WriteLine("min="+t.ShowMin());
        Console.WriteLine("max="+t.GetMax());
        Console.WriteLine(t.ToString());
        Console.WriteLine(t.ExistX(3));
        Console.WriteLine(t.IsExist7Boom());
    }
}
​
public class Item
{
    private BinNode<int> bnlist;
    private int min;
    private int max;
​
    public Item()
    {
        bnlist = null;
        min = int.MaxValue;
        max = int.MinValue;
    }
​
    public BinNode<int> GetBnlist ()
    {
        return this.bnlist;
    }
    
    
    public void Insert (int x)
    {
        BinNode<int> tmp = this.bnlist;
        if (tmp == null)
        {
            bnlist = new BinNode<int>(x);
            this.min = x;
            this.max = x;
        }
        else
        {
            while (tmp.HasRight())
                tmp = tmp.GetRight();
            BinNode<int> p = new BinNode<int> (x);
            tmp.SetRight(p);
            p.SetLeft(tmp);
            tmp=tmp.GetRight();
            if (x>this.max) this.max = x;
            if (x<this.min) this.min = x;
        }          
    }
  
    public int ShowMin ()
    {
         return this.min;
    }
    
    //assumption: the list is not empty
    public int GetMax()
    {
        BinNode<int> pos = bnlist;
        BinNode<int> posDel = bnlist;
        
        while (pos!=null)
        {
            if (pos.GetValue() == this.max)
                posDel = pos;
            pos = pos.GetRight();
        }
        if (posDel==bnlist && bnlist!=null && !posDel.HasRight())
            bnlist=null;
        else if (posDel==bnlist && bnlist!=null && posDel.HasRight())
        {
            bnlist = bnlist.GetRight();
            bnlist.SetLeft(null);
            posDel.SetRight(null);
        }
        else if (posDel!=bnlist && posDel.HasRight())
        {
            BinNode<int> p1 = posDel.GetLeft();
            BinNode<int> p2 = posDel.GetRight();
            p1.SetRight(p2);
            p2.SetLeft(p1);
            posDel.SetRight(null);
            posDel.SetLeft(null);
        }  
        else if (posDel!=bnlist && !posDel.HasRight())
        {
            BinNode<int> temp = posDel.GetLeft();
            temp.SetRight(null);
            posDel.SetRight(null);
            posDel.SetLeft(null);
        }
        return this.max;
    }
    
    public bool ExistX (int x)
    {
        BinNode<int> pos = bnlist;
        while (pos!=null)
        {
            if (pos.GetValue() == x)
                return true;
            pos = pos.GetRight();
        }
        return false;
    }
    
    public bool IsExist7Boom()
    {
        BinNode<int> pos = bnlist;
        while (pos!=null)
        {
            if (pos.GetValue()%7==0)
                return true;
            pos = pos.GetRight();
        }
        return false;
    }
    
    
    public override string ToString ()
    {
        string txt = "[";
        BinNode<int> pos = this.bnlist;
​
        while (pos != null)
        {
            txt = txt + pos.ToString();
            pos = pos.GetRight();
        }
       
        txt = txt + "]";
        txt = txt + "\n" + "min=" + this.min + ", max=" + this.max;
        return txt;
    }
    
    
}
​
​
​
​
public class BinNode<T>
{
    private T value;             
    private BinNode<T> left;     
    private BinNode<T> right;
    
    public BinNode (T x)
    {
        this.value = x;
        this.left = null;
        this.right = null;
    }
    
    public BinNode (BinNode<T> left, T x, BinNode<T> right)
    {
        this.value = x;
        this.left = left;
        this.right = right;
    }
    
    public T GetValue()
    {
        return this.value;
    }
    
    public BinNode<T> GetLeft()
    {
        return this.left;
    }
    
    public BinNode<T> GetRight()
    {
        return this.right;
    }
    
    public bool HasLeft()
    {
        if (this.left!=null) 
            return true;
        return false;
    }
    
    public bool HasRight()
    {
        if (this.right!=null) 
            return true;
        return false;
    }
    
    public void SetValue(T x)
    {
        this.value = x;
    }
    
    public void SetLeft(BinNode<T> left)
    {
        this.left = left;
    }
    
    public void SetRight(BinNode<T> right)
    {
        this.right = right;
    }
    
    public override String ToString ()
    {
        //return "("+left+" "+value+" "+right+")";
        /*if (value == null)
            return "null";
         if (GetRight() != null)
         
            return value + " --> " + GetRight().ToString();
          else
            return value + " -->";*/
        
         if (GetRight() != null)
         
            return value + " <=> " ;//+ GetRight().ToString();
          else
            return value+"";
    }
    
}
​
​
​
​
​
public class BusRoute 
{
    private Node<Station> path;
    
    public BusRoute (Station first, Station second)
    {
        this.path = new Node<Station> (second);
        this.path = new Node<Station> (first,this.path); 
        //this.path = new Node<Station> (first);
        //this.path.SetNext(new Node<Station> (second));
    }
    
    public void AddStation (Station newStation)
    {
        Node<Station> p = null;
        Node<Station> pos = this.path;
        while (pos!=null)
        {
            p=pos;
            pos=pos.GetNext();
        }
        p.SetNext(new Node<Station> (newStation));
    }
    public double RouteLength()
    {
        double len=0;
        Node<Station> pos=this.path;
        if (pos==null)
            return 0;
        while (pos.GetNext()!=null)
        {
            len=len+pos.GetInfo().Distance(pos.GetNext().GetInfo());
            pos=pos.GetNext();
        }
        return len;
    }
    
    public Node<Station> GetPath ()
    {
        return this.path;
    }
    
    public void SetPath (Node<Station> p)
    {
        this.path = p;
    }
    
    
    public override String ToString()
    {
        string str=this.path.ToString();
        Node<Station> pos=this.path.GetNext();
        while (pos!=null)
        {
            str = str+"-->"+pos.GetInfo().ToString();
            pos=pos.GetNext();
        }
        return str;
    }
}
​
​
public class BirthdaysSchool
{
    private Node<Student> [] ar;
    private const int SIZE = 6; //size of array
    
    public BirthdaysSchool (Node<Student> [] ar)
    {
        this.ar = ar;
        for (int i=0;i<SIZE;i++)
        {
            this.ar[i] = ar[i];
        }
    }
    
    public BirthdaysSchool ()
    {
        this.ar = new Node<Student>[SIZE];
        for (int i=0;i<SIZE;i++)
        {
            this.ar[i] = new Node<Student> (new Student ());
        }
    }
​
    public Node<Student>[] GetAr ()
    {
        return this.ar;
    }
    
    public void SetAr (Node<Student>[] ar)
    {
        this.ar = ar;
    }
    public override String ToString()
    {
        string str="";
        string text="";
        Node<Student> pos;
        for (int i=0;i<SIZE;i++)
        {
            str=this.ar[i].ToString();
            pos=this.ar[i].GetNext();
            while (pos!=null)
            {
               str = str+"-->"+pos.GetInfo().ToString();
               pos=pos.GetNext();
            }
            text = text + str + "\n";
        }
        return text;
    }
}
​
​
​
public class Student 
{
    private string name;    
    private Birth birthDay; 
    
    public Student (string name, Birth birthday)
    {
        this.name=name;
        this.birthDay=birthday;
    }
    
    public Student ()
    {
        this.name=null;
        this.birthDay=new Birth();
    }
    
    public string GetName ()
    {
        return this.name;
    }
    
    public Birth GetBirthDay ()
    {
        return this.birthDay;
    }
    
    public void SetBirthDay (Birth birthDay)
    {
        this.birthDay = birthDay;
    }
    
    
public void SetName (string name)
    {
        this.name = name;
    }
    
    public override String ToString()
    {
        return "name = " + this.name + " birthday = " + this.birthDay.ToString();
    }
}
​
​
​
​
​
​
public class Birth 
{
    private int day;    //day 1-31
    private int month;  //month 1-12
    private int year;   //year
    
    public Birth (int day, int month, int year)
    {
        this.day=day;
        this.month=month;
        this.year = year;
    }
    
    public Birth ()
    {
        this.day = 0;
        this.month = 0;
        this.year = 0;
    }
    
    public int GetDay ()
    {
        return this.day;
    }
    
    public int GetMonth ()
    {
        return this.month;
    }
    
    public int GetYear ()
    {
        return this.year;
    }
    
    public void SetDay (int day)
    {
        this.day = day;
    }
    
    public void SetMonth (int month)
    {
        this.month = month;
    }
    
    public void SetYear (int year)
    {
        this.year = year;
    }
    
    public override String ToString()
    {
        return this.day + "/" + this.month + "/" + this.year;
    }
}
​
​
​
​
​
​
​
public class Station 
{
    private int x;
    private int y;
    
    public Station (int x,int y)
    {
        this.x=x;
        this.y=y;
    }
    
    public int GetX ()
    {
        return this.x;
    }
    
    public int GetY ()
    {
        return this.y;
    }
    
    public void SetX (int x)
    {
        this.x = x;
    }
    public void SetY (int y)
    {
        this.y = y;
    }
    
    
    public double Distance (Station other)
    {
        double dis;
        dis=Math.Sqrt(Math.Pow((double)(this.x-other.x), 2.0)+Math.Pow((double)(this.y-other.y), 2.0));
        return dis;
    }
    
    public override String ToString()
    {
        return "("+this.x+","+this.y+")";
    }
}
​
​
​
​
​
​
public class Collec 
{
    private Node<int> first;
    private int max;
​
    public Collec() 
    {
        this.first = null;
        this.max = 0;
    }
​
    public Collec(int n)
    {
        if (this.first==null)
           this.max = n;
        this.first = new Node<int>(n); 
    }
​
    
    
    
    public bool Add(int n)
    {
        if (n <= max ) 
            return false;
        else
        {
            if (this.first == null)
                 this.first = new Node<int>(n);
            else
                 this.first.SetNext(new Node<int>(n, first.GetNext()));
        }
        return true;
    }
              
    public int Small()
    {
         Node<int> pos = this.first; 
         int min = int.MaxValue; 
         while (pos != null)
         {
              if (pos.GetInfo() < min) 
                  min = pos.GetInfo();
              pos = pos.GetNext(); 
         }
         return min; 
    }
​
    public int Smallest(Collec c)
    {
        return Math.Min(Small(), c.Small());
    }
    
    public Node<int> GetFirst ()
    {
        return this.first;
    }
    
    public void SetFirst (Node<int> first)
    {
        this.first = first;
    }
    
    public int GetMax ()
    {
        return this.max;
    }
    
    public void SetMax (int max)
    {
        this.max = max;
    }
    
    
    public override string ToString ()
    {
        string text = "[";
        Node<int> pos = this.first;
​
       while (pos != null)
       {
           text = text + pos.ToString();
           if (pos.HasNext())
               text = text + ", ";
           pos = pos.GetNext();
       }
        
        text = text + "]";
        return text;
     }
    
    
    
}
​
​
​
​
public class Competitor
{
    private int minutes;
    private int seconds;
    private string name;
​
    public Competitor (int minutes, int seconds, string name)
    {
        this.minutes = minutes;
        this.seconds = seconds;
        this.name = name;
    }
​
    public bool IsFaster (Competitor c)
    {
        if ( (this.minutes*60 + this.seconds) < (c.minutes*60 + c.seconds) )
            return true;
        return false;
    }
    
    public int GetMinutes ()
    {
        return this.minutes;
    }
    
    public int GetSeconds ()
    {
        return this.seconds;
    }
    
    public string GetName ()
    {
        return this.name;
    }
    
    public void SetMinutes (int minutes)
    {
        this.minutes = minutes;
    }
    
    public void SetSeconds (int seconds)
    {
        this.seconds = seconds;
    }
    
    public void SetName (string name)
    {
        this.name = name;
    }
    
    public override string ToString()
    {
        return "minutes = " + this.minutes + ", seconds = " + this.seconds + ", name = " + this.name + "\n";
    }
}
​
​
public class Race
{
    private Node<Competitor> first;
    
    public Race ()
    {
        this.first=null;
    }
    
    public void Add (Competitor c)
    {
        Node<Competitor> pos = this.first;
        Node<Competitor> prev = null;
        
        while (pos!=null && pos.GetInfo().IsFaster(c))
        {
            prev = pos;
            pos = pos.GetNext();
        }
        
        if (prev==null)
            this.first = new Node<Competitor>(c,this.first);
        else
            prev.SetNext(new Node<Competitor>(c,pos));
    }
    
    
    public string Rank (int x)
    {
        Node<Competitor> pos = this.first;
        for (int i=1; pos!=null && i<x; i++)
            pos = pos.GetNext();
        if (pos!=null) 
            return pos.GetInfo().GetName();
        return "not exist";
    }
    
    
    public Node<Competitor> GetFirst ()
    {
        return this.first;
    }
    
    public void SetFirst (Node<Competitor> first)
    {
        this.first = first;
    }
    
    public override string ToString ()
    {
        string text = "[";
        Node<Competitor> pos = this.first;
​
       while (pos != null)
       {
           text = text + pos.ToString();
           if (pos.HasNext())
               text = text + ", ";
           pos = pos.GetNext();
       }
        
        text = text + "]";
        return text;
     }
    
}
​
​
​
​
​
​
​
public class Node<T> 
{
    private T info;
    private Node<T> next;
    
    public Node (T info)
    {
        this.info=info;
        this.next=null;
    }
    public Node (T info, Node<T> next)
    {
        this.info=info;
        this.next=next;
    }
    public T GetInfo()
    {
        return this.info;
    }
​
public Node<T> GetNext()
    {
        return this.next;
    }
    public void SetInfo(T info)
    {
        this.info=info;
    }
    public void SetNext(Node<T> next)
    {
        this.next=next;
    }
​
//function that returns true if there is a next node (chulya okevet) 
//aheret returns false
    public bool HasNext()
{
return this.next != null;
}
    
    public override String ToString()
    {
        return this.info+" ";
    }
​
}
​
​
​
​
public class Stones
{
    private Node< BiStone > first;
    //private const int MAX=7;
    
    public Stones ()
    {
        this.first = new Node<BiStone> (new BiStone(0,0));
        Node<BiStone> pos = first;
        for (int i=0;i<=6;i++)
        {
            for (int j=10;j<=16;j++)
            {
                pos.SetNext(new Node<BiStone> (new BiStone(i,j)));
                pos = pos.GetNext();
            }
        }
        this.first = this.first.GetNext();          
    }
    
    public Node<BiStone> GetFirst ()
    {
        return this.first;
    }
    
    public void SetFirst (Node<BiStone> first)
    {
        this.first = first;
    }
    
    public override string ToString ()
    {
        string text = "";
        Node<BiStone> pos = this.first;
​
       while (pos != null)
       {
           text = text + pos.ToString();
           if (pos.HasNext())
               text = text + ", ";
           pos = pos.GetNext();
       }
        
        text = text + "]";
        return text;
     }
    
}
​
​
​
public class BiStone
{
    private int ones;// מספר חד ספרתי בין 0 ל-6 כולל
    private int tens;// מספר דו ספרתי בין 10 ל-16 כולל
​
​
    public BiStone(int ones, int tens)
    {
        this.ones = ones;
        this.tens = tens;
    }
    
    public bool SameDigit()
    {
        if (this.ones == (this.tens%10))
            return true;
        return false;
    }
​
    public int GetOnes ()
    {
        return this.ones;
    }
    
    public int GetTens ()
    {
        return this.tens;
    }
    
    public void SetOnes (int ones)
    {
        this.ones = ones;
    }
    
    public void SetTens (int tens)
    {
        this.tens = tens;
    }
    
    public override string ToString()
    {
        return "ones digit = " + this.ones + ", tens digit = " + this.tens + "\n";
    }
    
}

View IL Code