0% found this document useful (0 votes)
12 views

Binary Trees - 240723 - 100321

binary Trees

Uploaded by

ashu_hindustani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
12 views

Binary Trees - 240723 - 100321

binary Trees

Uploaded by

ashu_hindustani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 9
ree #includesstdio.h> Poem eecii any oad re struct tree_node*left; (ecg struct tree_node*right; 5 int data; Bisysseclmulelsl a ome lany place node* createNode() i a 7 o if(!t_node) return NULL; . 7 7 alsa etse Sales ae feel tae Waal sToYe (on } void insert(node** n,int data) — a cuca a if(!root) y r rate ee alae root=left=NULL; Trerreeaar Lisa Te) Perc ecrich a j : printf("inserting data %d\n",data); cing { PeTM UDA ek SCN ALANS RI") kone [errronee) i rears (err fr) dl ery i insert(&root->left,data); oi yi rere dant otherwise ira Pea MUMS cal up } void preOrderTraversal(node*n) v iiaey) { ioldllaae else i printf("[%p%d(%p)%p|\t",n->left,n->data,n,n->right); preOrderTraversal(n-2right); i } ne ce if(in) return; Liei<3 { inOrderTraversal(n->left); printf("[%p%d(%p)%p]\t",n->left,n->data,n,n->right); ee ULC a } void postOrderTraversal(node*n) i fiers) i ircldvlaaH sl else i postOrderTraversal(n->left); “FOP n0) G oe c _ Bom C1 B71 L UL aL) { DAS PaGaL eC) ys { if(data==n->data) ee AGL.) UR else { if(data>n->data) a ead PRTC Serre Kole Hae) } F a D ee ae as int main). x= os { PV Aaa aad node* n=NULL; —? i G SUA See Pe Nee ae iron One oer S04 w estate PO insert(&n,89); insert(&n,77); printf(“\nprinting pre order tree\n"); _____preOrderTraversal(n), printf("\nprinting in order tree\n"); inOrderTraversal(n); TaN ralVicvectcl Cn) Serra tsl-1 Rs) } PT cee bk aa Pea acd aes ce a ie ame) iho eens a a ~_— alee Coon are rm oe =) - orem, prereecs eas es oe Airs oes FD) Searth for he Cr TinTC NOME ae cod eheted , Cae ats arent olao. Sec | Racin Deca ais (ean) ea ic he ioe (Went ee cree " ; Oa MOLNAR CC eae G em erecta are eT chil ca ss ee eee eee alec ee DUO Vea Search tor inorder succenor ce nf vino Patong (WW sel ieee ta Node WY Now athe inorder _succerror wit BAC wae N Toa CAYTORS Le toy Se deloted an Bae CORLL lear (Ge Ud eros (Sree eee ‘es Crate Sa node> (Wye ae mee U OUI ab) AYote Boe q = woot Ce Ue O Le 40.4 sll 3 : i bead Sac Geto: eet ED) » ge Nol = aes N \ t — iy S Lana de remot a Te e SC Sa ca wor ene node x% Yok, node % * par, Node 4% x, dnt x Snel , int dora) { ae et Bae ees ree Run aeser Cag = Por = » aad te eee Neen) aa = x y daty = = Num, Se jo oie tot B 7 p) ela Pe a 4 Lay sera nud) = Lanne ca ao DP aRelGl os =e aoe es OM Eets CSURSY BEE or duccemer (LDR) Race io ze tame cam Low iby P(e ek eee ena SR C23 FON ce COM STO ea CCR ae is} ces ramet ato pn ene s eee BRS RO NR ea mee eee aoe cme the nodes Patt Sele On) D Cc © eo oe 240) ain Soy e Ono) — & Sn This Cone (4 WO CORRS n re ae aan eet aay cL ee CIE ea O40 cme moe. etna Reengy, FETT a ae rere CNB or i an) (ONC he) ao oa) Sa RCL foe aie cane “Aes fay

You might also like