Add to Favorites    Make Home Page 9606 Online  
 Language Categories  
 Our Services  

Home » C++ Home » Data Structures Home » dictionary implimentation in C++ using Binary Trees

A D V E R T I S E M E N T

Search Projects & Source Codes:

Title dictionary implimentation in C++ using Binary Trees
Author reedip banerjee
Author Email vyomworld [at] vyomworld.com
Description A dictionary in c++, where first, the dictionary is created
by
taking an input by the user for the words and their meanings.Next,these
are stored in a binary search tree,aftre which the file is saved.From
here
begins the actual program.Try it out!

Category C++ » Data Structures
Hits 55512
Code Select and Copy the Code
#include <stdio.h> #include<iostream.h> #include <conio.h> #include <string.h> #include <stdlib.h> #include<dos.h> #define LEFT 1 #define RIGHT 2 struct node { char word[20],meaning[100]; node *left,*right; }; node *maketree(char[],char[]); node* treefromfile(); void filefromtree(node*); void addword(node*,char[],char[]); void seperateword(char[],char[],char[]); void displayall(node*); node* bsearch(node*,char[]); void showmenu(); FILE *file_ptr; void prog() { clrscr(); char word[20],meaning[100]; int menuchoice; node *temp; temp=treefromfile(); if(temp==NULL) { printf(" File does not exist or dictionary is empty..."); getch(); } while(1) { clrscr(); showmenu(); scanf(" %d",&menuchoice); switch(menuchoice) { case 1:printf(" Enter word : "); scanf("%s",word); printf(" Enter meaning : " ); flushall(); gets(meaning); if(temp==NULL) temp=maketree(word,meaning); else addword(temp,word,meaning); break; case 2:if(temp==NULL) printf(" The dictionary is empty..."); else { printf(" Find meaning of : "); flushall(); gets(word); node *t; t=bsearch(temp,word); if(t==NULL) printf(" Word not found..."); else { printf(" %s : ",t->word); puts(t->meaning); } } getch(); break; case 3:if(temp==NULL) printf(" Dictionary is empty..."); else displayall(temp); getch(); break; case 4:filefromtree(temp); exit(1); break; default:cout<<" Enter Again"; delay(1000); prog(); break; } } } void showmenu() { printf(" COMPUTER DICTIONARY"); printf(" [1]. Add a word."); printf(" [2]. Find meaning."); printf(" [3]. Display all."); printf(" [4]. Save and Close. Enter Choice"); } node* treefromfile() { node *ptree=NULL; char word[20],meaning[100],str[120],*i; int flags=0; file_ptr=fopen("C:\dict.anu","r"); if(file_ptr==NULL) ptree=NULL; else { while(!feof(file_ptr)) { i=fgets(str,120,file_ptr); if(i==NULL) break; seperateword(str,word,meaning); if(flags==0) { ptree=maketree(word,meaning); flags=1; } else addword(ptree,word,meaning); } fclose(file_ptr); } return ptree; } node* maketree(char w[],char m[]) { node *p; p=new node; strcpy(p->word,w); strcpy(p->meaning,m); p->left=NULL; p->right=NULL; return p; } void seperateword(char str[],char w[],char m[]) { int i,j; for(i=0;str[i]!=' ';i++) w[i]=str[i]; w[i++]=NULL; //Append the null and skip the space. for(j=0;str[i]!=' ';i++,j++) { m[j]=str[i]; } m[j]=NULL; } void addword(node *tree,char word[],char meaning[]) { node *p,*q; p=q=tree; while(strcmp(word,p->word)!=0 && p!=NULL) { q=p; if(strcmp(word,p->word)<0) p=p->left; else p=p->right; } if(strcmp(word,q->word)==0) { printf(" This word already exists..."); delay(1000); } else if(strcmp(word,q->word)<0) q->left=maketree(word,meaning); else q->right=maketree(word,meaning); } node* bsearch(node *tree,char word[]) { node *q; q=tree; while(q!=NULL) { //p=q; if(strcmp(word,q->word)<0) q=q->left; else if(strcmp(word,q->word)>0) q=q->right; if(strcmp(word,q->word)==0) break; } return q; } void filefromtree(node *tree) { void travandwrite(node*); file_ptr=fopen("C:\dict.anu","w"); if(file_ptr==NULL) { printf(" Cannot open file for writing data..."); } else //if(tree==NULL) { if(tree!=NULL) { travandwrite(tree); } fclose(file_ptr); //Close the file anyway. } } void travandwrite(node *tree) { if(tree!=NULL) { fprintf(file_ptr,"%s %s ",tree->word,tree->meaning); travandwrite(tree->left); travandwrite(tree->right); } } void displayall(node *tree) { if(tree!=NULL) { displayall(tree->left); printf("%s : %s ",tree->word,tree->meaning); displayall(tree->right); } } void intro() { int i; clrscr(); gotoxy(20,20); cout<<"DICTIONARY LOADING"; for(i=0;i<50;i++) { gotoxy(15+i,21); cout<<"???"; gotoxy(20,22); cout<<2*i<<"% completed"; delay(150); } gotoxy(20,20); cout<<"DICTIONARY LOADING COMPLETED"; clrscr(); } void main() { clrscr(); intro(); prog(); }

Related Source Codes

Script Name Author
Moving ball screen saver karlmarx
The Classic Game of Snake & Ladder Lakshmi Narayana .A
Railway seat reservation question which comes in sapient VyomWorld
To calculate percentile Ravi Mathur
Send to folder ANIMESH SAHU
Analog clock and calendar Nazia & Rida
HIGH/LOW GAME MOLLY ARORA
Data structure (stack Implimentation) Swapnil B Adsure
Memory Game AnirudhSanyal
Easy Calc Anirudh Sanyal
GK Quiz Anirudh Sanyal
Hangman Game Manish Jain
Snakeman Manish Jain
Full month Calendar Nigi
Cursor shapes nigi

A D V E R T I S E M E N T




Google Groups Subscribe to SourceCodesWorld - Techies Talk
Email:

Free eBook - Interview Questions: Get over 1,000 Interview Questions in an eBook for free when you join JobsAssist. Just click on the button below to join JobsAssist and you will immediately receive the Free eBook with thousands of Interview Questions in an ebook when you join.

New! Click here to Add your Code!


ASP Home | C Home | C++ Home | COBOL Home | Java Home | Pascal Home
Source Codes Home Page

 Advertisements  

Google Search

Google

Source Codes World.com is a part of Vyom Network.

Vyom Network : Web Hosting | Dedicated Server | Free SMS, GRE, GMAT, MBA | Online Exams | Freshers Jobs | Software Downloads | Interview Questions | Jobs, Discussions | Placement Papers | Free eBooks | Free eBooks | Free Business Info | Interview Questions | Free Tutorials | Arabic, French, German | IAS Preparation | Jokes, Songs, Fun | Free Classifieds | Free Recipes | Free Downloads | Bangalore Info | Tech Solutions | Project Outsourcing, Web Hosting | GATE Preparation | MBA Preparation | SAP Info | Software Testing | Google Logo Maker | Freshers Jobs

Sitemap | Privacy Policy | Terms and Conditions
Copyright ©2003-2017 SourceCodesWorld.com, All Rights Reserved.
Page URL: http://www.sourcecodesworld.com/source/show.asp?ScriptID=1098


Download Yahoo Messenger | Placement Papers | Free SMS | C Interview Questions | C++ Interview Questions | Quick2Host Review