Skip to content

Java implementation of Binary Search Tree and Huffman Encoding for Data Structures and Algorithms CSC2103 Assignment.

License

Notifications You must be signed in to change notification settings

Nonentity5565/Binary_Search_Tree_and_Huffman_Encoding

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

17 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

BST and Huffman

About

Adapted from the included report.

In teams of two, students of Data Structures and Algorithms CSC2103 in the April 2021 semester at Sunway University were tasked with a final project to demonstrate their knowledge in two of seven algorithms, namely:

  • Shortest Pathfinding
  • Hashing
  • Binary Search Tree
  • Red-Black Tree
  • Huffman Coding
  • String Matching (except naïve)
  • Dijkstra's Algorithm

For this project, the Binary Search Tree (BST) and Huffman Coding programs were implemented in Java.

Both implementations are CLI programs and visualise the algorithms for the user's understanding.

Further Reading

For further reading and a more in-depth write-up on this project, please download and view the included report.

About

Java implementation of Binary Search Tree and Huffman Encoding for Data Structures and Algorithms CSC2103 Assignment.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Java 100.0%