A program that once compiled creates two executable files. bst and primegap. bst takes as input first the number of integers and then the maximum value of an int plus one. With this input, an array is generated from the input given for the number of elements and their range. A Binary Search Tree is then created from the generated array. The BST …

binary search tree implementation

Basic algorithms of Graph and Tree Data structures

Data structures implemented using C

its runs are created by BSTs

Competitive programming challenges and their solutions for Codefocers, Hackerrank, and Leetcode.

Repository is about AVL, BST and LISTS

This is a repository for balancing a Binary Search Tree using a brute force recursive algorithm.

A simple bst implementation in C

An undergrad assignment for BST

Data Structures using C and C++. Arrays, Linked List, Stack, Queue, ADT, Tree, Graph, Binary Search Tree, Sorting, Searching, Hashing, Algorithm

Classical Algorithm and Data Structure Problems

p(t)sd

Implementation of binary search trees & hashtables as dictionaries in pure C with comparison between them

This repository offers diverse programming resources for my "Programmazione 2" university exam prep. Topics covered: binary search trees, graphs, linked lists, queues, recursion, and trees. Includes exercises, exams, and C++ code.

This Repository contains DS related Questions and answers.