To efficiently retrieve exact optimal solutions, we propose an iterative-deepening A*-based tree search algorithm using admissible lower and efficient upper bound algorithms for guaranteed optimality.

This repository contains my implementations of fundamental Data Structures and Algorithms in C. It is organized topic-wise (Arrays, Searching, Sorting, Stacks, Queues, Linked Lists, Trees, Graphs), ...