binary tree implementation - Data Structures Source Code in C++

Special : Web Developer's Collection CD-ROM
50,000+ Web Templates, Logos, Cliparts, Scripts. Order Now!

Add to Favorites Make Home Page

1244 Online

Language Categories

Source Codes Home
Project Ideas New!
Interview Questions
FAQs Home
ASP Home: ASP Source Codes; ASP Script Directory New!; ASP .Net Script Directory New!; ASP Interview Questions; ASP FAQs; ASP How Tos
C Home: C Source Codes; C Script Directory New!; C Interview Questions; C FAQs; C How Tos
C++ Home: C++ Source Codes; C++ Script Directory New!; C++ Interview Questions; C++ FAQs; C++ How Tos
Java Home: Java Source Codes; Java Directory New!; Java Interview Questions; Java FAQs; Java How Tos
JavaScript Home: JavaScript Directory New!; JavaScript Source Codes; JavaScript FAQs; JavaScript How Tos
COBOL Home: COBOL Source Codes; COBOL FAQs; COBOL How Tos
Pascal Home: Pascal Source Codes; Pascal FAQs; Pascal How Tos
PHP Script Directory New!
Python Script Directory New!
Perl & CGI Script Directory New!
Flash Script Directory New!
CFML Script Directory New!
Remotely Hosted Scripts New!
Tools & Utilities Directory New!
XML Script Directory New!
Best Programmers: Amit Mathur; Vishal Bhardwaj; Deepesh Jain
Vyom NetWork

Our Services

Get 9,000 Interview Questions & Answers in an eBook.

9500+ Pages
9000 Question & Answers
All Tech. Categories

14 MB Content

Get it now !!

Home » C++ Home » Data Structures Home » binary tree implementation

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

Title	binary tree implementation
Author	Hareesh Arumughom
Author Email	hari_a_s [at] hotmail.com
Description
Category	C++ » Data Structures
Hits	375992
Code	Select and Copy the Code
/* Binary tree implementation in CPP / / --------------------------------- / #include <iostream.h> #include <conio.h> #include <stdlib.h> struct node { node left; int value; node right; }; node curr=NULL; int addnode(node , node ); int inorder(node ); int preorder(node ); int postorder(node ); void main() { char c; int v; clrscr(); do { cout<<" Select any one "; cout<<" 0 ->Exit "; cout<<"1 ->Add node "; cout<<"2 ->Inorder traversal "; cout<<"3 ->Preorder traversal "; cout<<"4 ->Postorder trversal : "; cin>>c; switch(c) { case '0': exit(1); case '1': node temp; temp = new node; cout<<" Enter the value of the node : "; cin>>temp->value; if(curr==NULL) { curr=new node; curr->value=temp->value; curr->left=NULL; curr->right=NULL; cout<<" The root node is added "; } else v=addnode(curr,temp); if(v==1) cout<<" The node is added to the left "; else if(v==2) cout<<" The node is added to the right "; else if(v==3) cout<<" The same value exists "; break; case '2': v=inorder(curr); if(v==0) cout<<" The tree is empty "; break; case '3': v=preorder(curr); if(v==0) cout<<" The tree is empty "; break; case '4': v=postorder(curr); if(v==0) cout<<" The tree is empty "; break; default: cout<<" Invalid entry "; break; } }while(c!='0'); getch(); } int addnode(node fcurr, node fnew ) { if(fcurr->value==fnew->value) { return 3; } else { if(fcurr->value > fnew->value) { if(fcurr->left != NULL) addnode(fcurr->left, fnew); else { fcurr->left = fnew; (fcurr->left)->left=NULL; (fcurr->left)->right=NULL; return 1; } } else { if(fcurr->right != NULL) addnode(fcurr->right, fnew); else { fcurr->right = fnew; (fcurr->right)->left=NULL; (fcurr->right)->right=NULL; return 2; } } } } int inorder(node fincurr) { if(fincurr == NULL) return 0; else { if(fincurr->left != NULL) inorder(fincurr->left); cout<<fincurr->value<<" "; if(fincurr->right != NULL) inorder(fincurr->right); } } int preorder(node fprcurr) { if(fprcurr == NULL) return 0; else { cout<<fprcurr->value<<" "; if(fprcurr->left != NULL) preorder(fprcurr->left); if(fprcurr->right != NULL) preorder(fprcurr->right); } } int postorder(node *fpocurr) { if(fpocurr == NULL) return 0; else { if(fpocurr->left != NULL) postorder(fpocurr->left); if(fpocurr->right != NULL) postorder(fpocurr->right); cout<<fpocurr->value<<" "; } }

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.

Free Tutorials - HTML, Java, SQL, PHP, ASP, Perl, SQL Tutorials
Discuss Programming Problems and Freshers Jobs related issues here.
Discuss Final Year Project Ideas here.

Advertisements

L I N K S

Jobs & Career: Freshers Jobs; Jobs Newsletter; Placement Papers; Placement Papers
GATE Preparation: Analysis & Design Of Algo.; Operating System; Lexical Analysis
GRE Preparation: GRE Home; 1208 Antonyms Test; 5000 Word's List; Top 100 Words' List; Scholarships; Top 100 CS Univ.; Top 126 EE Univ.
Tutorials: Hardware Tutorial; 1500 Free eBooks; XML Tutorial
Webmaster Resources: EzTraffic; Articles
Fun: Send FREE SMS!; SMS Jokes; Love SMS; Funny Jokes

Google Search

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

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