Initial commit

2019-11-15 12:59:38 +01:00
parent 40a414d210
commit b880c3ccde
6814 changed files with 379441 additions and 0 deletions
@@ -0,0 +1,78 @@
+BinarySearchTree.h - Header file for binary search tree
+	
+	#ifndef BINARY_SEARCH_TREE_H_
+        #define BINARY_SEARCH_TREE_H_
+
+        #include "dsexceptions.h"
+        #include <iostream.h>       // For NULL
+
+          // Binary node and forward declaration because g++ does
+          // not understand nested classes.
+        template <class Comparable>
+        class BinarySearchTree;
+
+        template <class Comparable>
+        class BinaryNode
+        {
+            Comparable element;
+            BinaryNode *left;
+            BinaryNode *right;
+
+            BinaryNode( const Comparable & theElement, BinaryNode *lt, BinaryNode *rt )
+              : element( theElement ), left( lt ), right( rt ) { }
+            friend class BinarySearchTree<Comparable>;
+        };
+
+
+        // BinarySearchTree class
+        //
+        // CONSTRUCTION: with ITEM_NOT_FOUND object used to signal failed finds
+        //
+        // ******************PUBLIC OPERATIONS*********************
+        // void insert( x )       --> Insert x
+        // void remove( x )       --> Remove x
+        // Comparable find( x )   --> Return item that matches x
+        // Comparable findMin( )  --> Return smallest item
+        // Comparable findMax( )  --> Return largest item
+        // boolean isEmpty( )     --> Return true if empty; else false
+        // void makeEmpty( )      --> Remove all items
+        // void printTree( )      --> Print tree in sorted order
+
+        template <class Comparable>
+        class BinarySearchTree
+        {
+          public:
+            explicit BinarySearchTree( const Comparable & notFound );
+            BinarySearchTree( const BinarySearchTree & rhs );
+            ~BinarySearchTree( );
+
+            const Comparable & findMin( ) const;
+            const Comparable & findMax( ) const;
+            const Comparable & find( const Comparable & x ) const;
+            bool isEmpty( ) const;
+            void printTree( ) const;
+
+            void makeEmpty( );
+            void insert( const Comparable & x );
+            void remove( const Comparable & x );
+
+            const BinarySearchTree & operator=( const BinarySearchTree & rhs );
+
+          private:
+            BinaryNode<Comparable> *root;
+            const Comparable ITEM_NOT_FOUND;
+
+            const Comparable & elementAt( BinaryNode<Comparable> *t ) const;
+
+            void insert( const Comparable & x, BinaryNode<Comparable> * & t ) const;
+            void remove( const Comparable & x, BinaryNode<Comparable> * & t ) const;
+            BinaryNode<Comparable> * findMin( BinaryNode<Comparable> *t ) const;
+            BinaryNode<Comparable> * findMax( BinaryNode<Comparable> *t ) const;
+            BinaryNode<Comparable> * find( const Comparable & x, BinaryNode<Comparable> *t ) const;
+            void makeEmpty( BinaryNode<Comparable> * & t ) const;
+            void printTree( BinaryNode<Comparable> *t ) const;
+            BinaryNode<Comparable> * clone( BinaryNode<Comparable> *t ) const;
+        };
+
+        #include "BinarySearchTree.cpp"
+        #endif