CodeBhavyaCODEBHAVYA · MODEL · OPERATE · ANALYSE
Data StructuresLearn why a structure is chosen, which invariants keep it correct, how every operation changes state and when another structure becomes the better engineering choice.
Each project connects abstract operations to business behaviour, invariants, edge cases, complexity and interview-level design decisions.
Model Back, Forward and Visit using a doubly linked list, including the subtle rule that visiting after Back deletes the abandoned forward branch.
Implement a stable priority queue where clinical urgency outranks arrival time while patients of equal priority remain first-come, first-served.
Convert infix expressions to postfix and evaluate them using separate operator and value stacks with full precedence, associativity and error handling.
List which actions must be fast and which are occasional.
State what must remain true after every operation.
Follow ownership and links before writing implementation code.
Compare arrays, stacks, queues, lists, heaps and indexed alternatives.