Freaks City

Linear List Implementations Array-Based Sequence template <typename T> class Sequence { private: T* data; int capacity; int count; int current; public: Sequence(int size) : capacity(size), count(0), current(0) { data = new T[capacity]; } ~Sequence() { delete[] data; } void insert(T val ...

Binary Search Tree A Binary Search Tree (BST) is a node-based binary tree data structure which has the following propetries: The left subtree of a node contains only nodes with keys lesser than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. The left and right subtree each must also be a b ...