// נועה ברציאנו

using System;

namespace Ex

{

    public class Program

    {

        public static void Main()

        {

             Stack<int> st = new Stack<int>();

            st.Push(5);

            st.Push(2);

            st.Push(8);

            st.Push(1);

            st.Push(4);

            int min = FindMin(st);

            Console.WriteLine("The lowest value in the stack is: " + min);

        }

​

        public static int FindMin(Stack<int> st)

        {

            int min = st.Pop();

            while (!st.IsEmpty())

            {

                int item = st.Pop();

                if (item < min)

                    min = item;

            }   

            return min;

        }

    }

}

​

public class Node<T> 

{

    private T value;

    private Node<T> next;

    public Node (T value)

    {

        this.value=value;

        this.next=null;

    }

​

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

    {

        this.value=value;

        this.next=next;

    }

    public T GetValue()

    {

        return this.value;

    }

​

    public Node<T> GetNext()

    {

        return this.next;

    }

    public void SetValue (T value)

    {

        this.value=value;

    }

    public void SetNext(Node<T> next)

    {

        this.next=next;

    }

​

    // הפעולה מחזירה אמת אם קיימת חוליה עוקבת, אחרת מחזירה שקר

    public bool HasNext()

    {

       return this.next != null;

    }

    public override String ToString()

    {

        return this.value.ToString();

    }

}

​

​

// המחלקה מחסנית

public class Stack<T> 

{

    private Node<T> first;

    public Stack()

    {

        this.first=null;

    }

    public bool IsEmpty()

    {

        return this.first==null;

    }

    public void Push (T x)

    {

        this.first=new Node<T> (x,this.first);

    }

    public T Pop ()

    {

        T x=this.first.GetValue();

        this.first=this.first.GetNext();

        return x;

    }

    public T Top ()

    {

        return this.first.GetValue();

    }

    public override String ToString()

    {

        String str="top[";

        Node<T> pos = this.first;

        while (pos!=null)

        {

            str=str+pos.GetValue().ToString();

            if (pos.GetNext()!=null)

                str=str+",";

            pos=pos.GetNext();

        }

        str=str+"]bottom";

        return str;

    }

}