https://github.com/d-k-deng/dataprocessing_practice

The program processes personal records from a file using custom-implemented data structures such as Binary Search Trees (BST), heaps, and hashmaps, with an emphasis on generics and without relying on built-in Java classes like LinkedList and PriorityQueue.
https://github.com/d-k-deng/dataprocessing_practice

data-processing data-structures java

Last synced: 19 days ago
JSON representation

The program processes personal records from a file using custom-implemented data structures such as Binary Search Trees (BST), heaps, and hashmaps, with an emphasis on generics and without relying on built-in Java classes like LinkedList and PriorityQueue.

• Host: GitHub
• URL: https://github.com/d-k-deng/dataprocessing_practice
• Owner: D-K-Deng
• License: mit
• Created: 2023-09-24T20:06:57.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-10-23T13:05:41.000Z (about 1 year ago)
• Last Synced: 2024-01-26T14:37:44.365Z (11 months ago)
• Topics: data-processing, data-structures, java
• Language: Java
• Homepage:
• Size: 60.5 KB
• Stars: 3
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# DataProcessing_Practice

The program processes personal records from a file using custom-implemented data structures such as Binary Search Trees (BST), heaps, and hashmaps, with an emphasis on generics and without relying on built-in Java classes like LinkedList and PriorityQueue.

**About people.txt**

Each line in the file contains a person’s record as: 

given name; family name; company name; address; city; county; state; zip; phone1; phone2; email; 

web; birthday

Each field is split by ‘;’.

This project uses BST, heap, and hashmap and implements multiple functions without using Java built-in classes LinkedList and PriorityQueue. Moreover, **generic** 🤙