Contains my solutions for Bilkent University Fundemantal Structures of Computer Science course.
Homework 1
: Algorithm Efficiency and SortingTopics
: Bubble sort, Quick sort, Merge sort, Selection, Sort, Recurrence Relationships, Performance Analysis of Different Sorting Algorithms
Homework 2
: Binary Search TreesTopics
: Binary trees, Binary search trees, Inorder traversal, Preorder traversal, Postorder traversal, Binary search tree height, Height analysis of inserting different items to a binary searh tree
Homework 3
:Topics
: