- A BST (Binary Search Tree) based book Analyser.
- It can sort the words in the books as per their frequency count or as per their lexographical order.
- I Created a templated BST from scratch and used it as the base data structure to store words and word frequencies in a different special object.
- I used OOPs principles to design this.
- It uses a builtin C++ hashmap as an auxiliary data structure.
-
Notifications
You must be signed in to change notification settings - Fork 0
A BST (Binary Search Tree) based book Analyser. It can sort the words in the books as per their frequency count or as per their lexographical order. I Created a templated BST from scratch and used it as the base data structure to store words and word frequencies in a different special object. I used OOPs principles to design this.
Rahul555-droid/BST-Book-Analyser
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A BST (Binary Search Tree) based book Analyser. It can sort the words in the books as per their frequency count or as per their lexographical order. I Created a templated BST from scratch and used it as the base data structure to store words and word frequencies in a different special object. I used OOPs principles to design this.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published