What is required is the sum of the structure and all the instances
inside it.
The code I am using is the following:
I will have an instance of the Stack class given below with data inside
it.
internal class Node
{
# region Private Fields
private object data;
private Node previous;
private Node next;
# endregion
# region Constructors
/// <summary>
/// Creates an instance of the Node class.
/// </summary>
/// <param name="obj">The value to be placed on stack</param>
public Node(object obj)
{
Data = obj;
Previous = null;
Next = null;
} // end constructor
# endregion
# region Data
/// <summary>
/// The value to be placed on stack.
/// </summary>
public object Data
{
set
{
data = value;
} // end set
get
{
return data;
} // end get
} // end property Data
/// <summary>
/// The node previous to this node.
/// </summary>
public Node Previous
{
set
{
previous = value;
} // end set
get
{
return previous;
} // end get
} // end property Previous
/// <summary>
/// The Node next to this node.
/// </summary>
public Node Next
{
set
{
next = value;
} // end set
get
{
return next;
} // end get
} // end property Next
# endregion
} // end class Node
// ***************************************
public class Stack
{
# region Private Fields
private int count;
private Node bottomStack;
private Node topStack;
# endregion
# region Constructors
/// <summary>
/// Creates an instance of the Stack class.
/// </summary>
public Stack()
{
count = 0;
bottomStack = null;
topStack = null;
} // end constructor
# endregion
# region Public Methods
/// <summary>
/// Inserts an object at the top of the stack.
/// </summary>
/// <param name="obj"></param>
public void Push(object obj)
{
Node n = new Node(obj);
if (bottomStack == null)
{
bottomStack = n;
topStack = n;
} // end if
else
{
topStack.Next = n;
n.Previous = topStack;
topStack = topStack.Next;
} // end else
Count++;
} // end method Push
/// <summary>
/// Returns the object that is found on top of the stack.
/// </summary>
/// <returns></returns>
public object PeekTop()
{
object obj;
obj = null;
if (Count == 0)
{
throw new InvalidOperationException("Stack empty.");
} // end if
else
{
obj = topStack.Data;
} // end else
return obj;
} // end method PeekTop
/// <summary>
/// Removes and returns the object that is found on top of the stack.
/// </summary>
/// <returns></returns>
public object PopTop()
{
object obj;
obj = null;
if (Count == 0)
{
throw new InvalidOperationException("Stack empty.");
} // end if
else
{
obj = topStack.Data;
if (Count == 1)
{
topStack = null;
bottomStack = null;
} // end if
else
{
topStack = topStack.Previous;
topStack.Next = null;
} // end else if
Count--;
} // end else
return obj;
} // end method PopTop
/// <summary>
/// Returns the object that is found on the bottom of the stack.
/// </summary>
/// <returns></returns>
public object PeekBottom()
{
object obj;
obj = null;
if (Count == 0)
{
throw new InvalidOperationException("Stack empty.");
} // end if
else
{
obj = bottomStack.Data;
} // end else
return obj;
} // end method PeekBottom
/// <summary>
/// Removes and returns the object that is found on the bottom of the
stack.
/// </summary>
/// <returns></returns>
public object PopBottom()
{
object obj;
obj = null;
if (Count == 0)
{
throw new InvalidOperationException("Stack empty.");
} // end if
else
{
obj = bottomStack.Data;
if (Count == 1)
{
topStack = null;
bottomStack = null;
} // end if
else
{
bottomStack = bottomStack.Next;
bottomStack.Previous = null;
} // end else
Count--;
} // end else
return obj;
} // end method PopBottom
/// <summary>
/// Removes all objects from the stack.
/// </summary>
public void Clear()
{
bottomStack = null;
topStack = null;
Count = 0;
} // end method Clear
# endregion
# region Properties
/// <summary>
/// Holds the current size of the Stack
/// </summary>
public int Count
{
set
{
count = value;
} // end set
get
{
return count;
} // end get
} // end property Count
# endregion
} // end class Stack
