A console-based application that analyses a .txt file, extracts word frequencies, tracks line numbers, and stores the results in a Binary Search Tree (BST). Ideal for demonstrating data structure design and algorithm complexity.
- Store all unique words using a custom
BinaryTree - Display:
- Total unique word count
- Most frequent word
- Longest word
- Line numbers for a given word
- Words in alphabetical or original order
- BST implementation with
BinaryTreeNode.csandBinaryTree.cs - Efficient search, insertion, and in-order traversal
Program.cs: Main logicBinaryTree.cs: Tree operationsBinaryTreeNode.cs: Node structure.slnand.csproj: Project files
- Open in Visual Studio or Rider
- Build and run the
TextAnalysisToolproject - When prompted, enter the path to a
.txtfile
β οΈ This tool does not include the Moby Dick text file. Use any.txtfile for analysis.
- Uses a Binary Search Tree (BST) for dynamic insertion and ordered retrieval
- Compared against Dictionary and LinkedList in the project report
MIT
Bhargav Vaidya β MSc Data Science