Implementation of common algorithms with tests

Generic tries in Coq.

Optimal Connect Four with Alpha-Beta Pruning

Augmented Binary Search Tree. Projeto de Estrutura de Dados Básicas II (DIM0117, T01, 2018.1)

Implementation of the Trie data strucutre.

GUI for displaying Binary Search Trees written in C++ using the Qt Library.

A rhymer imagined for apple siri using effective radix tree searches

лабы по предмету СиАОД (Системы и Алгоритмы Обработки Данных)

Implementation of splay tree data structure

Desktop app for visualizing graph search algorithms

AVLTree self-balancing binary tree

Java implementation for Introduction to Algorithms book.

Get a tree full path by the given condition.

Differential Ternary Search Tree in TypeScript.

A simple python class for search in binary tree. This class provides a few methods for searching in binary tree. Search methods are recursive and non-recursive. You can easily search in binary tree with only on left or right child, and you can search in binary tree with both left and right child.

Advanced implementation of Red-black tree, which is a kind of self-balancing binary search tree for JavaScript

Implementation of Binary Search Tree in C++ - Basics

Algorithms

Am implementation of the recursive MiniMax search tree algorithm (in Python) for the purpose the development of an intelligent Checkers Player.

The use of the PRIM algorithm to find a minimum spanning tree. The program uses the selected database in CSV format and converts it into a graph to find the minimum spanning tree through the Prim's Algorithm. The chosen database needed to be transformable into a connected, weighted, and undirected graph to ensure error-free processing.