This project is part of a research lab practice focused on optimizing word search operations by experimenting with different Binary Search Tree (BST) variants. The goal is to reduce the search path and improve the efficiency of both single word and range searches.
We explore multiple BST variants and evaluate their performance for various search operations. This includes comparisons of standard BSTs and customized variants tailored for optimized word lookup.
For more background and methodology, refer to:
TP English.pdfComplement TP.pdf
The final research findings are compiled in the report:
Amara.K.W_Azzouz_G12_TP2_ALSDD_Report.pdf
- C – Core logic and data structure implementation (
main.c) - Z Language – Additional logic implemented in
main.alg - Python (matplotlib) – Used to generate performance comparison graphs
Compile and run the main.c file using a C compiler (e.g., gcc):
gcc main.c -o word_search
./word_search
These graphs illustrate significant performance improvements when using optimized BST variants for single word searching tasks.
- Amara Khaled Walid
- Azzouz Zaki
Supervised by: Pr D.E Zegour
This project is part of an academic exercise and is not licensed for commercial use. This work is property of the Higher School of Computer Science Algiers (ESI Algiers).