Question

PLEASE HELP ME WITH QUESTIONS 2 AND 3 WITH COMPILED SOURCE CODE AND OUTPUT. IN C OR JAVA. DO NOT GIVE INCORRECT ANSWERS.

2. Using your favorite programming language, implement the BST ADT in a linked structure, along with the following operations: search, insert and remove. 3. Implement the InOrder traversal method discussed in class, which shows the keys of the BST n increasing order.

Answer 1

Ans node.h # define My-NOOc class Node public Node ept Node Y ight . int value Node Cint ) end iR node CPp t include node h # include < iostream> using nome smcc Std lConstnuctom wode :: Node (int value) this->value-value",

3, BST define -S include "node.cpp. # include <íosheom» using namespace std Class 85 T publie ll constsudos BST C bool add Cint) //td he rode u.r%, ne minimum value Min - bool remove Cint ):

bool Seaxch Cint) Voidl inondexO void inonder-Hill (wode End ie BST.CP # include 'esn' ft include ostcam using nomespoue std BST: 6ST C) this-> 100t:null bool 8ST :: add Cint val ll ie Element is alecdy prexat Sovch (va) yetuan Palse; cs Scanned

ip the Csoent Soblsee is mpty I allocode memosy to a neuo node ode neuo-node ne Node Cnetadota) retunn neo node if the value Should be odded to the lept Sub ies ll if he value should be adkoled to the sight sobtace tsav->ight : ad d.vtill(やov-wigh,neadata ). bool 8S7:: 1emove Cint val) l aet he noste uih lie mininum value Node BST ics Cs Scanned with

Move to Ihe lept Most node while Ctemp- lept) temp te (ept cton temp ll ip the taee is mpty netuTn tzov; 랴 rte node to be deleted isin The left Subtree it (val < +°v> value ) ll recuoxively calt The Ponction Pubc Jav → teet ve move-Utin Gravー) lef+.val); ll it the node to be deleted is in the Yg sobtee else it (val > +30V-> Value ) I leas ivdy call The fonction for it, sobtec Scanned wi

i lke ctand node rs to be deleted lif theve is no leps chid is no lepf chid Yenove memcoy delete txov yelon temp ll get te node usith miniom value /1 stoxe the value of inoaides Surtcesor in the cscd noe o- value temp- Value ll inonden Succe is Yem ove d bool 6s Seaich Cint val ) Scanned with CamScanner

/1祁te (tone占初ee i Empty return fulles if te node is fod llip Val İìq in tte lett subtaee Secock-Uti" (hu. → virt.val); void 8sT:: inond a 6) inonder -ll his Yoot): it Ctnuu) cs ssened with

8 mauncpp ヂinclude BsT.cf? # include aseam > using nonespor std at MounC lcoeate a 85T ohjet BST ob ob. odd C35) ob odd C50J: ob add Cus) ob, add(#5): Cout ze Tsee Elements, '» ob. inosido C ob、remove (35); ob remove (so); else Cout E nlns is present" cs Scanned Netano CamScanr