https://github.com/tusharmakkar08/trie_data_structure

Advanced Data Structure Trie
https://github.com/tusharmakkar08/trie_data_structure

Last synced: 25 days ago
JSON representation

Advanced Data Structure Trie

• Host: GitHub
• URL: https://github.com/tusharmakkar08/trie_data_structure
• Owner: tusharmakkar08
• License: mit
• Created: 2013-09-21T04:18:48.000Z (about 11 years ago)
• Default Branch: master
• Last Pushed: 2013-11-10T18:04:17.000Z (almost 11 years ago)
• Last Synced: 2023-04-01T12:52:16.584Z (over 1 year ago)
• Language: Python
• Size: 17.4 MB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
Problem Statement 

------------------

Given ten million words (unsorted) with an average length of 8 characters. The task is to

search for a word from these ten million words.

Give your

a) Data structure with justification

b) Efficient algorithm

c) Complexity analysis to accomplish this task.

TRIE_Data_Structure

===================

A trie, also called digital tree or sometimes radix tree or prefix tree (as they can be searched by prefixes),

is an ordered tree data structure that is used to store a dynamic set or associative array where the keys are 

usually strings. Unlike a binary search tree, no node in the tree stores the key associated with that node;

instead, its position in the tree defines the key with which it is associated. All the descendants of a node

have a common prefix of the string associated with that node, and the root is associated with the empty string.

Values are normally not associated with every node, only with leaves and some inner nodes that correspond to 

keys of interest.

**I have implemented Trie in C++ and Python**

File Structure

===============

* main.cpp - User Interface code File  - Trie Implemented

* code_for_inp.cpp - File Oriented Main code File - Trie + Cache Implemented

* serialize.py - Code for serializing the data for fast processing 

* result.txt - File Containing Serialized Data 

* user_inp_pyt.py - User input in python . Valid for any type of string .

* 160_mill.py - Code for running trie on 160 million words.

Prerequisites of System 

========================

* Python Interpreter

* G++ compiler

* CPickle Python Library

Instructions on running the code 

================================

* For running `main.cpp` 

	* `g++ main.cpp`

	* `./a.out`

* For running `code_for_inp.cpp` 

	* `g++ code_for_inp.cpp`

	* `./a.out < medium_in_58110`

* For running `serialize.py` 

	* `python serialize.py`

* For running `serialize.py` 

	* `python serialize.py`

* For running `user_inp_pyt.py` 

	* `python user_inp_pyt.py`

* For running `160_mill.py` 

	* `python 160_mill.py` 

Testing Conditions

=================

Tested on files of size 160 million .

Testing Environment

===================

* Primary memory : 1.8 GB

* Swap : 0

* Dual Core Pentium Processor