🌳 This repository is dedicated to the Binary Search Tree (BST) data structure, featuring a comprehensive demo of all its functionalities including insertion, deletion, search, and traversal operations. It serves as an educational resource for understanding BSTs in depth, offering code examples and explanations suitable for students and developers.

Algorithms and ADTs • binary search algorithm • conditions necessary for the use of a binary search • performance of a binary search • implement an insertion sort • implement a bubble sort • performance of a sort routine • find an item in : linked list, binary tree, hash table • insert an item: stack, queue, linked list, binary tree, hash table …

This project is used to demonstate how a binary tree using linked lists is handled in the C language and the corresponding performance of using an binary tree system to store and search for elements.

Binary Tree & Trie Data Structures implementations; questions and solutions