Scribd
Upload
5 views3 pages

Data Structures and Algorithms Assignment

The document describes implementing a binary search tree data structure. It includes inserting nodes with keys and values into the tree, and performing a backtracking operation on the tree.

Uploaded by

aman gupta
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views3 pages

Data Structures and Algorithms Assignment

The document describes implementing a binary search tree data structure. It includes inserting nodes with keys and values into the tree, and performing a backtracking operation on the tree.

Uploaded by

aman gupta
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

2020WA86361

Asmita Majumd
CSIWZe 363
Data
stuuctusio Omd Algorit
Wit a data stuctune amol #sendocode to store thu
namus weekdan and aoces them b he numbev
olay wtthun he weok
Solutfon' #include <stdiohy
int main)
naigned ul weok;

pine ("tnlu week mumber (1-D: );


ACMg ( %u', A week Asif (eek = 9)
=

H(week=- 4) phindtg("Sunday );
puin H("Monday );
las if (week
= =
2) puintf(Invalid Input!
PLAAA l a the
prin(Tunda) e e umben

butueenl-9.9;
lt if (week 3)= -

netu ma 0;
pin ("hlednnday)
thu if weK = 4)

Puints("3ruaday );
lauif (weeh -5)
PAintH(friday );
elauif we 2 6)
Pintf( Sauxday
ASST67NMENT-L Pag
2020WA 86361
AsMITA MA JUUDER
CSI WZC 363
Data stuctune amd
ALgoni-thrw
Implument hu baok tnakuing oynamic At ADT Auamg a BsT
aAs Me
mdenlyung daln stuclunThe nods t h BST shoul dl
tontan h hilda Key anmd value. Ahough you will only ual the
Key ulds i thin aignmeE,he tmplumintatin shoulod
ntal, amol my nod should ConAaui a u l l objtct m
vauut kiu
Solucion
Slep 0 stanting stat of T uturu Valuu nene

(46

Slep1:Inant (T, 1)
Ruunn VAlu None

(2.
2)
(46)
ASST 6 NMEN
fa
2020WA 86361
ASMITA MAJUM DEK
STWZe 363
Dot StruetuL omd Agon-hm
Slep 2 maxímum (1)
Rlunn valu 46 Slep 5: back-thrack (
Riun vaue . OnL

Step3 dsla (T, 24


Run valw No

30

Slep4: backtreck (T
Rum Valu ' onL

You might also like