BST.cpp File Reference

Implementation of the BST (Binary Search Tree) class. More...

#include "BST.h"
#include "Stack.h"
#include "Queue.h"
#include <iostream>

Go to the source code of this file.

Detailed Description

Implementation of the BST (Binary Search Tree) class.

This file contains the iterative implementation of all BST operations, including insertion, search, deletion, traversal, and cleanup.

All algorithms are implemented without recursion, using explicit stack and queue data structures where appropriate. The BST owns all dynamically allocated Node objects and is responsible for their lifetime management.

This implementation is intentionally pointer-based and avoids the use of STL containers or smart pointers to demonstrate fundamental memory management concepts in C++.

Definition in file BST.cpp.