TreeType.cpp

#include <iostream>
#include "TreeType.h"

using namespace std;

struct TreeNode
{
  ItemType info;
  TreeNode* left;
  TreeNode* right;
};

bool TreeType::IsFull() const
// Returns true if there is no room for another item
//  on the free store; false otherwise.
{
  TreeNode* location;
  try
  {
    location = new TreeNode;
    delete location;
    return false;
  }
  catch(std::bad_alloc exception)
  {
    return true;
  }
}

bool TreeType::IsEmpty() const
// Returns true if the tree is empty; false otherwise.
{
  return root == NULL;
}

int CountNodes(TreeNode* tree);

int TreeType::GetLength() const
// Calls recursive function CountNodes to count the
// nodes in the tree.
{
  return CountNodes(root);
}


int CountNodes(TreeNode* tree)
// Post: returns the number of nodes in the tree.
{
  if (tree == NULL)
    return 0;
  else
    return CountNodes(tree->left) + CountNodes(tree->right) + 1;
}

void Retrieve(TreeNode* tree,
     ItemType& item, bool& found);

ItemType TreeType::GetItem(ItemType item, bool& found)
// Calls recursive function Retrieve to search the tree for item.
{
  Retrieve(root, item, found);
  return item;
}


void Retrieve(TreeNode* tree,
     ItemType& item, bool& found)
// Recursively searches tree for item.
// Post: If there is an element someItem whose key matches item's,
//       found is true and item is set to a copy of someItem;
//       otherwise found is false and item is unchanged.
{
  if (tree == NULL)
    found = false;                     // item is not found.
  else if (item < tree->info)
    Retrieve(tree->left, item, found); // Search left subtree.
  else if (item > tree->info)
    Retrieve(tree->right, item, found);// Search right subtree.
  else
  {
    item = tree->info;                 // item is found.
    found = true;
   }
}

void Insert(TreeNode*& tree, ItemType item);

void TreeType::PutItem(ItemType item)
// Calls recursive function Insert to insert item into tree.
{
  Insert(root, item);
}


void Insert(TreeNode*& tree, ItemType item)
// Inserts item into tree.
// Post:  item is in tree; search property is maintained.
{
  if (tree == NULL)
  {// Insertion place found.
    tree = new TreeNode;
    tree->right = NULL;
    tree->left = NULL;
    tree->info = item;
  }
  else if (item < tree->info)
    Insert(tree->left, item);    // Insert in left subtree.
  else
    Insert(tree->right, item);   // Insert in right subtree.
}
void DeleteNode(TreeNode*& tree);

void Delete(TreeNode*& tree, ItemType item);

void TreeType::DeleteItem(ItemType item)
// Calls recursive function Delete to delete item from tree.
{
  Delete(root, item);
}


void Delete(TreeNode*& tree, ItemType item)
// Deletes item from tree.
// Post:  item is not in tree.
{
  if (item < tree->info)
    Delete(tree->left, item);   // Look in left subtree.
  else if (item > tree->info)
    Delete(tree->right, item);  // Look in right subtree.
  else
    DeleteNode(tree);           // Node found; call DeleteNode.
}

void GetPredecessor(TreeNode* tree, ItemType& data);

void DeleteNode(TreeNode*& tree)
// Deletes the node pointed to by tree.
// Post: The user's data in the node pointed to by tree is no
//       longer in the tree.  If tree is a leaf node or has only
//       non-NULL child pointer the node pointed to by tree is
//       deleted; otherwise, the user's data is replaced by its
//       logical predecessor and the predecessor's node is deleted.
{
  ItemType data;
  TreeNode* tempPtr;

  tempPtr = tree;
  if (tree->left == NULL)
  {
    tree = tree->right;
    delete tempPtr;
  }
  else if (tree->right == NULL)
  {
    tree = tree->left;
    delete tempPtr;
  }
  else
  {
    GetPredecessor(tree->left, data);
    tree->info = data;
    Delete(tree->left, data);  // Delete predecessor node.
  }
}

void GetPredecessor(TreeNode* tree, ItemType& data)
// Sets data to the info member of the right-most node in tree.
{
  while (tree->right != NULL)
    tree = tree->right;
  data = tree->info;
}

void PrintTree(TreeNode* tree, std::ofstream& outFile)
// Prints info member of items in tree in sorted order on outFile.
{
  if (tree != NULL)
  {
    PrintTree(tree->left, outFile);   // Print left subtree.
    outFile << tree->info;
    cout << tree->info;
    PrintTree(tree->right, outFile);  // Print right subtree.
  }
}

void TreeType::Print(std::ofstream& outFile) const
// Calls recursive function Print to print items in the tree.
{
  PrintTree(root, outFile);
}

TreeType::TreeType()
{
  root = NULL;
}

void Destroy(TreeNode*& tree);

TreeType::~TreeType()
// Calls recursive function Destroy to destroy the tree.
{
  Destroy(root);
}


void Destroy(TreeNode*& tree)
// Post: tree is empty; nodes have been deallocated.
{
  if (tree != NULL)
  {
    Destroy(tree->left);
    Destroy(tree->right);
    delete tree;
  }
}

void TreeType::MakeEmpty()
{
  Destroy(root);
  root = NULL;
}


void CopyTree(TreeNode*& copy,
     const TreeNode* originalTree);

TreeType::TreeType(const TreeType& originalTree)
// Calls recursive function CopyTree to copy originalTree
//  into root.
{
  CopyTree(root, originalTree.root);
}

void TreeType::operator=
     (const TreeType& originalTree)
// Calls recursive function CopyTree to copy originalTree
// into root.
{
  {
  if (&originalTree == this)
    return;             // Ignore assigning self to self
  Destroy(root);      // Deallocate existing tree nodes
  CopyTree(root, originalTree.root);
  }

}
void CopyTree(TreeNode*& copy,
     const TreeNode* originalTree)
// Post: copy is the root of a tree that is a duplicate
//       of originalTree.
{
  if (originalTree == NULL)
    copy = NULL;
  else
  {
    copy = new TreeNode;
    copy->info = originalTree->info;
    CopyTree(copy->left, originalTree->left);
    CopyTree(copy->right, originalTree->right);
  }
}
// Function prototypes for auxiliary functions.

void PreOrder(TreeNode*, QueType&);
// Enqueues tree items in preorder.


void InOrder(TreeNode*, QueType&);
// Enqueues tree items in inorder.


void PostOrder(TreeNode*, QueType&);
// Enqueues tree items in postorder.


void TreeType::ResetTree(OrderType order)
// Calls function to create a queue of the tree elements in
// the desired order.
{
  switch (order)
  {
    case PRE_ORDER : PreOrder(root, preQue);
                     break;
    case IN_ORDER  : InOrder(root, inQue);
                     break;
    case POST_ORDER: PostOrder(root, postQue);
                     break;
  }
}


void PreOrder(TreeNode* tree,
     QueType& preQue)
// Post: preQue contains the tree items in preorder.
{
  if (tree != NULL)
  {
    preQue.Enqueue(tree->info);
    PreOrder(tree->left, preQue);
    PreOrder(tree->right, preQue);
  }
}


void InOrder(TreeNode* tree,
     QueType& inQue)
// Post: inQue contains the tree items in inorder.
{
  if (tree != NULL)
  {
    InOrder(tree->left, inQue);
    inQue.Enqueue(tree->info);
    InOrder(tree->right, inQue);
  }
}


void PostOrder(TreeNode* tree,
     QueType& postQue)
// Post: postQue contains the tree items in postorder.
{
  if (tree != NULL)
  {
    PostOrder(tree->left, postQue);
    PostOrder(tree->right, postQue);
    postQue.Enqueue(tree->info);
  }
}

void AddElements(TreeType &tree, int info[], int toIndex, int fromIndex);
ItemType TreeType::GetNextItem(ItemType& item, OrderType order, bool& finished)
// Returns the next item in the desired order.
// Post: For the desired order, item is the next item in the queue.
//       If item is the last one in the queue, finished is true;
//       otherwise finished is false.
{
  finished = false;
  switch (order)
  {
    case PRE_ORDER  : preQue.Dequeue(item);
                      if (preQue.IsEmpty())
                        finished = true;
                      break;
    case IN_ORDER   : inQue.Dequeue(item);
                      if (inQue.IsEmpty())
                        finished = true;
                      break;
    case  POST_ORDER: postQue.Dequeue(item);
                      if (postQue.IsEmpty())
                        finished = true;
                      break;
  }
  return item;
}

// Exercise 6 --------------------------------------------------------------

void PrintAncestors(TreeNode* tree, ItemType& item, bool& found, std::ofstream& outFile);

ItemType TreeType::Ancestors(ItemType item, bool& found, std::ofstream& outFile)
// Calls recursive function PrintAncestors to print the item's ancestors.
{
  PrintAncestors(root, item, found, outFile);
  return item;
}

void PrintAncestors(TreeNode* tree, ItemType& item, bool& found, std::ofstream& outFile)
// Function: Prints ancestors of a given item
// Precondition: Stores elements while traversing the tree to search for the item.
// Postcondition: If there is an element someItem whose key matches item's,
// found is true and ancestors are printed out else found is false and nothing is printed.
{
    int flag = 1;

    outFile << tree->info << endl;
    cout << tree->info << endl;

    do{
        if (tree == NULL)
        {
            found = false;
            flag = 0;
            break;
        }
        else if (item < tree->info)
        {
            tree = tree->left;  // Ancestor in left tree
            if (item == tree->info)
            {
                break;
            }
            else
            {
                outFile << tree->info << endl;
                cout << tree->info << endl;
            }
        }
        else if (item > tree->info)
        {
            tree = tree->right; // Ancestor in right tree
            if (item == tree->info)
            {
                break;
            }
            else
            {
                outFile << tree->info << endl;
                cout << tree->info << endl;
            }
        }
        else
        {
            item = tree->info;
            found = true;   // If item is present
            flag = 0;
            break;
        }
    }while(flag == 1);
}

//
void PrintAncestorsReverse(TreeNode* tree, ItemType& item, bool& found, std::ofstream& outFile);

ItemType TreeType::AncestorsReverse(ItemType item, bool& found, std::ofstream& outFile)
// Calls recursive function PrintAncestors to print the item's ancestors.
{
  PrintAncestorsReverse(root, item, found, outFile);
  return 0;
}
// Function: Prints ancestors of a given item
// Precondition: Stores elements while traversing the tree to search for the item.
// Postcondition: If there is an element someItem whose key matches item's,
// found is true and ancestors are printed out else found is false and nothing is printed.
void PrintAncestorsReverse(TreeNode* tree, ItemType& item, bool& found, std::ofstream& outFile)
{
    if (tree == NULL)
        found = false;                     // item is not found.
    else if (item < tree->info)
    {
        PrintAncestorsReverse(tree->left, item, found, outFile); // Search left subtree.
        outFile << tree->info << endl;
        cout << tree->info << endl;
    }
    else if (item > tree->info)
    {
        PrintAncestorsReverse(tree->right, item, found, outFile);// Search right subtree.
        outFile << tree->info << endl;
        cout << tree->info << endl;
    }
    else
    {
        item = tree->info;                 // item is found.
        found = true;
    }
}

// count leaves function
int Leaves(TreeNode* tree);

ItemType TreeType::LeafCount(int leaves)
{
    leaves = Leaves(root);
    return leaves;
}

int Leaves(TreeNode* tree)
{
  if( tree == NULL )
    {
        return 0;
    }
  if( tree->left == NULL && tree->right == NULL )
    {
        return 1;
    }
  else
    {
        return Leaves(tree->left) + Leaves(tree->right);
    }
}

// Single Parent Function
int SingleParent(TreeNode* tree);

ItemType TreeType::SingleParentCount(int spcount)
{
    spcount = SingleParent(root);
    return spcount;
}

int SingleParent(TreeNode* tree)
{
    // Took idea from http://stackoverflow.com/questions/27219895/java-counting-single-parents-in-a-binary-search-tree
    int count = 0;
    if (tree != NULL)
    {
        if( (tree->left == NULL && tree->right != NULL))
        {
            count++;
        }
        else if( tree->left != NULL && tree->right == NULL )
        {
            count++;
        }
        count += SingleParent(tree->left);
        count += SingleParent(tree->right);
    }
    return count;
}