Homework Assignment: Binary Search Tree Project in C

Objective: The objective of this homework assignment is to implement a simple project using a

binary search tree $($BST$)$ data structure in C programming language. Students will gain practical

experience in applying BSTs to solve real$-$world problems and reinforce their understanding of tree

operations.

Project Description: You are required to implement a program that manages a dictionary of words

using a binary search tree. The program should allow the user to perform the following operations:

$1.$ Insert a new word.

$2.$ Delete an existing word.

$3.$ Search for a word.

$4.$ Display all words in alphabetical order.

$5.$ Quit the program.

Instructions:

$1.$ Implement a binary search tree data structure to store the words.

$2.$ Write functions to perform insertion, deletion, search, and display operations on the binary

search tree.

$3.$ Ensure that the code is properly commented to explain the purpose of each function and any

complex logic.

$4.$ Test the implementation by inserting several words, performing various operations, and

verifying the correctness of the results.

Make use of functions to modularize your code and maximize code reuse.

Properly comment your code.

Do the homework yourself. Do not submit copy assignments.

Submit your final single C source code file containing all functions to Ninova, do not include binaries.