Stack Class Reference

Represents an explicit stack used to support non-recursive tree operations. More...

#include <Stack.h>

Public Member Functions
	Stack ()
	Constructs an empty Stack.
	~Stack ()
	Destroys the Stack.
void	push (Node *n)
	Pushes a node onto the stack.
Node *	pop ()
	Removes and returns the node at the top of the stack.
bool	isEmpty () const
	Checks whether the stack is empty.

Detailed Description

Represents an explicit stack used to support non-recursive tree operations.

The Stack class implements a simple stack structure composed of node pointers. It is used to support traversal and deletion operations within a binary search tree, including non-recursive in-order traversal and tree destruction.

The Stack does not assume ownership of the tree nodes it stores; it manages only the stack nodes required to support these operations.

Supported operations include:

• push(): Adds a node pointer to the top of the stack.
• pop(): Removes and returns the top node pointer.
• isEmpty(): Checks whether the stack is empty.

Definition at line 65 of file Stack.h.

Constructor & Destructor Documentation

Stack()

Stack::Stack ( )

inline

Constructs an empty Stack.

Note

Initializes the stack with its top pointer set to nullptr.

Definition at line 71 of file Stack.h.

: top(nullptr) {}

~Stack()

Stack::~Stack

(

)

Destroys the Stack.

Destroys the stack by removing all remaining nodes.

Definition at line 21 of file Stack.cpp.

              {
    // Remove all nodes from top to bottom.
    while (!isEmpty()) {
        pop();
    }
}

Member Function Documentation

isEmpty()

bool Stack::isEmpty

(

)

const

Checks whether the stack is empty.

Returns

True if the stack contains no elements.

Determines whether the stack has any elements.

Definition at line 52 of file Stack.cpp.

                          {
    return top == nullptr;
}

pop()

Node * Stack::pop

(

)

Removes and returns the node at the top of the stack.

Returns

Pointer to the node removed from the stack.

Pops a node off the stack and returns the stored tree node pointer.

Definition at line 40 of file Stack.cpp.

                 {
    if (!top) return nullptr;
    StackNode* temp = top;
    Node* result = temp->data;
    top = top->next;
    delete temp;
    return result;
}

push()

void Stack::push

(

Node *

n

)

Pushes a node onto the stack.

Parameters

n	Pointer to the Node being added to the top of the stack.

Inserts a node pointer at the top of the stack.

Definition at line 31 of file Stack.cpp.

                        {
    StackNode* s = new StackNode(n);
    s->next = top;
    top = s;
}

---

The documentation for this class was generated from the following files:

• Stack.h
• Stack.cpp