Question

just explain it in english would be enough.

modify the standard definition of a binary search tree to add a field N.size at each Suppose that we node, which records the size of the subtree under N'Tincluding N itself). A. Explain how to modify the procedure for adding both the case where X is not yet in the tree and is added, and the case where X is already in the tree, and the tree remains unchanged. element X to a tree. Be sure to consider an You only need to describe the changes that are made to the standard algorithm; you do not have to repeat the standard algorithm. B. Explain how to modify the procedure for deleting an element. As in (A), consider both cases. C. Describe a procedure for finding the kth largest element in the tree. D. Describe a procedure for finding the number of elements in the tree less than X All of these procedures should run in time proportional to the height of the tree.

Answer 1

Answer N SIZE: binary gearch ree is a binany ree e adnide Set af data Stngle tkm called idem ahich i eikey empty he 0ot and too disjoint binasy dreass called te lestt subtre or Sats fres he and ght ob-tree) hich is eithe empAy Joecaing Yula valre of left sso tree is leas than he valwe ot wot ihere than r eawal to thevalve value o.ftig ht gubtree is oDot (3)Althe btreel of lett and ght btrees obseve he twn rules qnen in Second line. fhe image N. Size i Same as Thus here N.grze ecord the e o Sob-tree chdey N Cincluding N) CA Mdit rocedne for adding an elamant Xe atree

Procedire Algorithm ot addng element with boh cote -Stwet tcord ingort Chuct &oce, ng dig it, lorg N peat dyr atoty oLL) p 3to 6 Cshw ct ecardmalloc CsrcofCetwet cand 3- ee = NULL jyba<-at=tra -mel h =dgits S ree -S nong = (iN 9 Elre step - lett > Z-tree ->nn)re-> lept= inpert(tree . 9. N=NL Jo- Else tep TCdigittreenum) -trec-> night= inport (frse.-> right, 1 (3 Elbe step M digit tree->nmree -> Dight = Pnsext Ctree -> ts NNT

le. fr duprcate hodes Exit) 19. end mody pro Cedure for deloting an element .Procadure Algorithm af deleting X elament with bo th capel stwet reayd lelnan Cink digit,/ struct eordY, long N 3-Stuct deGyd del nmCdit Ymight, N) S Ese G. -nu = Y-> Num; 1o struct teod delednode Cint dig it, 3trúet reard ree Long N

1a Shuct recid r, * 3 TfCtree NUL) 14.5 ENita) 16. deletenode Cdiqit , tree-> lert, N) ir 19. NNL- 40 else nn) tree-> 2aletenole digit ,brec->right, N) 3- N =NT--j gy. NULL As. else NULL) tree left; else 28 iC-> left= = NulL) G&ree --bree = q, ~: Ag. elee Cdrgit, let ) dilnun

31 33 end Procadurefor indg dh Kh Lorgett doment in hetree Procadre c algo ithm tor nd ing kh elament for search eng day itint NSty void Search Ctwct eCord bee -= NUU') gkp3 a. if Ctree 3. Pots Cp nunbex "); 4- else if Cdgit , dayjit); tree-hwn) 6 elte idgit Search Cree-> lest, digit, N); clee gearch Ctree - > left, dig it, N) 1. end Procadure for Sind ing e nwbe o elemenit in the tree tes than X Same Prcedure of in c tree Senatron coill be alled Por search Bitanly lett