You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
My solutions to all the assignments of the IC-253 [Data Structures & Algorithms] course @ IIT-Mandi [Jan-July 2025]. Assignment Question Paper PDFs are also provided.
Topics: Binary Trees, Stacks, Expression Conversion (Infix to Postfix, Postfix to Infix), Parenthesis Matching, Merge Sort, Tower of Hanoi, Linked List Position Finding
These solutions are provided for reference and learning purposes. Please ensure you follow your institution's academic integrity policies when using this repository.
Contact
For questions or discussions about the implementations, feel free to reach out.
"Bad programmers worry about the code. Good programmers worry about data structures and their relationships." - Linus Torvalds
About
My solutions to all the assigments of the IC-253 [Data Structures & Algorithms] course @ IIT-Mandi [Jan-July 2025]. Assignment Question Paper PDFs are also provided.