PAD 2 - Internship 5

This repository is about BinarySearchTrees

You can download the Worksheet here.

Required classes:

• class Node {};

• class BinarySearchTree {};
  

Required functions:

• void insert(T data);

• void delete(const long& key);

• void clear();

• void rotateLeft(const long& key);

• void rotateRight(const long& key);

• void balance()

• void printPreOrder(Node<T>* node, const std::string& str);

• void printInOrder(Node<T>* node, const std::string& str);

• void printPostOrder(Node<T>* node, const std::string& str);
  

Optional variants:

You can use starting arguments to catch issues or loading files like a database.

• int main(int argc, char* argv[])
  

This functions are not implemented yet!

• void dumpTree();
  

• void loadFromFile();
  

Screenshots: