BY- SUPRIYA B S

USN-1NH18CS404
• To understand the concept of binary search tree.

• Its applications , advantages, dis-advantage and limitations

• To understand and implement the operational aspects of

binary search tree, in order traversal. .

• Handling operations like searching, deletion, display, traversing

mechanism etc. on various data structures.
• The aim of the project is to provide a dictionary meanings for
users.

• This project aims at providing an easier and basic meaning to

the users .

• It helps the users. when we type the word and search for a
meaning . It has a user-friendly interface which helps the user
to check for meanings.
• A dictionary is a collection of elements each of which
have a unique search key.

• A binary search tree is a binary tree such that each node

stores a key of a dictionary. The main objective is
implementation of a dictionary, that contains word with
there relevant description and allow the user to populate it
with large amount of information and still remain
searchable.

• This model is backed using data structure commonly

known as binary tree using c language. The advantage of
using BST is that all major operations( insertion, deletion ,
search and traversal)
• The project is made using data structures,
files, in c language.
Data structure used is binary search tree

Binary search tree (BST) is based on binary tree data structure.

The left sub-tree of a node contains only with keys lesser than
the nodes key. The right sub-tree of a node contains only nodes
with keys larger (or) greater than the nodes key.
• Software Requirements –
• Processor : INTEL i3 X86 compatible processor
• RAM : 512 MB or more
• Hard disk : 500 GB

• Hardware Requirements –
• DEV C++ / code blocks coding platform.
• Windows 10 operating system
• Data structures like binary search tree
• Files for permanent data storage and access