using System;

​

namespace ConsoleApp16

{

    public class Program

    {

       public static void Main()

        {

            //צרו תור גנרי ומלאו את התור בערכים מסוג 

            //double

            //הדפיסו את התור

            //הדפיסו ממוצע , איבר מקסימאלי ,ו איבר מינימאלי

​

            Queue<double> qe = new Queue<double>();

            qe.insert(5.3);

            qe.insert(4.2);

            qe.insert(4.1);

            qe.insert(8.6);

            qe.insert(7.5);

            qe.insert(4.2);

            qe.insert(9.2);

​

            qe.printQueue();

            Queue<double> holder = new Queue<double>();

            double average = 0, min = 0, max = 0, help = 0;

            int counter = qe.counter();

​

            if (qe.isEmpty())

            {

                Console.WriteLine("Error, It's Empty!");

            }

            else

            {

                for(int i = counter; i > 0; i--)

                {

                    help = qe.remove();

                    holder.insert(help);

                    average += help;

                }

                min = help;

                for (int i = counter; i > 0; i--)

                {

                    help = holder.remove();

                    qe.insert(help);

                    if (help > max)

                    {

                        max = help;

                    }

                    if(min > help)

                        min = help; 

                } 

                average /= counter;

                Console.WriteLine("The average of queue = {0} \nThe Minimum = {1} \nThe Maximum = {2}" , average,min,max);

            } 

        }

    }

    public class Node<T>

     {

         private T val;

         private Node<T> next;

         private Node<T> Head;

         private Node<T> item;

         private int count = 0;

​

         public Node()

         {

​

             next = null;

         }

         public Node(T val, Node<T> next)

         {

             this.val = val;

             this.next = next;

         }

         public T GetVal()

         {

             return val;

         }

         public void SetVal(T val)

         {

             this.val = val;

         }

         public Node<T> GetNext()

         {

             return next;

         }

         public void SetNext(Node<T> next)

         {

             this.next = next;

         }

     }

​

     class Node

     {

         private int val;

         private Node next;

         private Node Head;

         private Node item;

         private int count = 0;

​

         public Node()

         {

             val = 0;

             next = null;

         }

         public Node(int val, Node next)

         {

             this.val = val;

             this.next = next;

         }

         public int GetVal()

         {

             return val;

         }

         public void SetVal(int val)

         {

             this.val = val;

         }

         public Node GetNext()

         {

             return next;

         }

         public void SetNext(Node next)

         {

             this.next = next;

         }

     }

​

    public class Queue<T>

    {

        private Node<T> first;

        private Node<T> last;

        private int count = 0;

        public Queue()

        {

            last = first = null;

        }

        public void insert(T value)

        {

            Node<T> newelement = new Node<T>(value, null);

​

            if (first == null)

            {

                first = newelement;

            }

            else

            {

                last.SetNext(newelement);

            }

            last = newelement;

            count++;

        }

         public T remove()//  first:last: null

         {

​

             T retvalue = first.GetVal();

             first = first.GetNext();

             if (first == null) 

                last = null;

            count--;

            return retvalue;

​

         }

         public bool isEmpty()

         {

             return first == null;

         }

         public T head()

         {

             return first.GetVal();

         }

​

        public void printQueue()

        {

            Node<T> temp = first;

            if (this.isEmpty())

                Console.WriteLine("Error, It's Empty!");

​

            else

            {

                Console.WriteLine("The Queue is:");

                while (temp.GetNext() != null)

                {

                    Console.Write(temp.GetVal() + "," + " ");

                    temp = temp.GetNext();

                    if (temp.GetNext() == null)

                        Console.Write(temp.GetVal());

                }

                Console.WriteLine("");

            }

        }

        public int counter()

        {

            return count;

        }

    }

}

​