1. Advanced Data Structure using C++

LECTURE NOTES OF ADVANCED DATA STRUCTURE (MT-CSE 110)
1 2 3 4 5
A(f=1,r=1)
A(f=1) B(r=2)
A(f=1) B C(r=3)
A(f=1) B C D(r=4)
A(f=1) B C D E(r=5)
Steps one by one(insertion)
Step 1: in queue table there are five elements are filled one by one first is
empty so F=0,R=0
Step 2:insert A so, F=1,R=1 in special case
Step 3: insert B so, F=1,R=2
Step 4: insert C so, F=1,R=3
Step 5: insert D so, F=1,R=4
Step 6: insert E so, F=1,R=5
Step 7: insert F so , it can’t be inserted
DELETION TABLE
Prepared By :­
Er. Harvinder Singh
Assist Prof., CSE, H.C.T.M (Kaithal) Page ‐ 142 ‐