Data Structures and Algorithms Project




1 / 4
BST code snippet
Binary Search Tree (BST) code snippet

My partner and I created a fully importable and useable data structures module. This module was written in Java and can be used in place of the built in data structure libraries. Apache Maven was used to create and build the importable module, which can be found on the github link found below.

Specs


  • Software: Java
  • Dependencies: None
  • Code Repository:  

Project Details


This project was completed as the final assignment for ENSF 338 at the University of Calgary.

This project focused on the creation of a fully importable and useable data structures module using Java. Many different data structures were implemented, including:

  • Singly Linked List
  • Circular Singly Linked List
  • Doubly Linked List
  • Circular Doubly Linked List
  • Stack
  • Queue
  • AVL Tree
  • Binary Search Tree

All of these data structures have fully implemented functionality, with many public functions that can be called by the user. Within each data structure class, a main function is included which includes a wide range of test boundary cases. The data structures were packaged using Apache Maven and can be imported into many projects to use in place of the built in data structure libraries.








Contact Me



Reach Out



Feel free to contact me at any time. I welcome all feedback and suggestions for this site or any of the projects here.



  Calgary, Alberta, Canada


  (403)-472-9927