Java implementation for Introduction to Algorithms book.
Golang generic Interval Search Tree
GUI for displaying Binary Search Trees written in C++ using the Qt Library.
Desktop app for visualizing graph search algorithms
Advanced implementation of Red-black tree, which is a kind of self-balancing binary search tree for JavaScript
Implementation of splay tree data structure
Implementation of common algorithms with tests
Implementation of Binary Search Tree in C++ - Basics
Differential Ternary Search Tree in TypeScript.
Get a tree full path by the given condition.
Implementation of the Trie data strucutre.
Optimal Connect Four with Alpha-Beta Pruning
Tarefas para o aprendizado de algoritmos, da cadeira Algoritmo e Estrutura de Dados do curso de Sistemas de Informação (SI) do CIn da UFPE, cadeira cursada por mim em 2023.
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.
Research project on CS. A little library that implements binary search trees as a basic structure and several wrappers for more efficient work with them (balancing, high-levelled data structures, etc)
AVLTree self-balancing binary tree
Algorithms
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.
Add a description, image, and links to the search-tree topic page so that developers can more easily learn about it.
To associate your repository with the search-tree topic, visit your repo's landing page and select "manage topics."