simonayzman

#include <iostream>
#include "SortedVector.h"       // Found in https://github.com/CSCI235-Ayzman/SortedStructures
#include "SortedLinkedList.h"   // Found in https://github.com/CSCI235-Ayzman/SortedStructures

using namespace std;

class Residence
{
public:
    Residence(double newPrice = 1.0) : price(newPrice) {}

simonayzman

#include <iostream>
#include <vector>

using namespace std;

class Residence {
public:
  Residence(double newPrice = 0.0) : price(newPrice) {}
  virtual ~Residence() {}
  double getPrice() { return price; }

simonayzman

#include <iostream>
#include <vector>

using namespace std;

class Residence {
public:
  Residence(double newPrice = 1.0) : price(newPrice) {}
  virtual ~Residence() {}
  double getPrice() { return price; }

simonayzman

template<typename T>
int find(const T& item, T* array, unsigned int size) 
{
   for (unsigned int i = 0; i < size; ++i)
   {
      // Assume T has properly overloaded operator==
      if (array[i] == item)
      {
         return i;
      }

simonayzman

template <typename T1, typename T2>
struct Pair{
	T1 first;
	T2 second;
};

simonayzman

class Polygon{ 
public:
  virtual ~Polygon() {}
  
  int perimeter(){
    double sum = 0;
    for(int i = 0; i < sides.size(); i++){
      sum += sides[i];
    }
    return sum;

simonayzman

template<class T>
string toString(T type) {
  std::ostringstream strs;
  strs << type;
  return strs.str();
}

class Instructor {
public:
  Instructor(string theName) : name(theName) {}

simonayzman

void LinkedList::skipAndRemove(int skipNum, int removeNum){
	// There is either currently nothing in the list
	// or you're instructed not to remove anything
	if (head == NULL || removeNum == 0) {
		return;
	}
	
	// Skip nothing; therefore, remove everything
	if (skipNum == 0) {
		this->clear();	// Assume this exists

simonayzman

// Note that this is an interesting kind of tree, where there is no overall structure that contains nodes.
// Instead the tree is itself a node.
template<class ItemType>
class Tree {
 private:
   Tree<ItemType> * left;
   Tree<ItemType> * right;
   ItemType data;   
   
 public: 

simonayzman

#include <iostream>
#include <vector>
using namespace std;

template<class T>
struct TreeNode{
   T data;
   TreeNode<T> * right;
   TreeNode<T> * left;      
};