Search Results for "binary search tree animated"
Sort By:
Showing 37 open source projects for "binary search tree animated"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
1
Vcpkg
C++ Library Manager for Windows, Linux, and MacOS
Vcpkg helps you manage C and C++ libraries on Windows, Linux and MacOS. This tool and ecosystem are constantly evolving, and we always appreciate contributions! After you've gotten vcpkg installed and working, you may wish to add tab completion to your shell. With CMake, you will still need to find_package and the like to use the libraries. Check out the CMake section for more information, including on using CMake with an IDE. In classic mode, vcpkg produces an "installed" tree, whose... -
2
XML Tree Editor
Basic cross-platform tree view XML editor
XMLTreeEdit displays XML files as tree views and allows basic operations: adding, editting and deleting text nodes and their attributes. The main goal is providing a simple tool to create/edit XML configuration files for users without knowledge of XML. Built in Free Pascal Lazarus, which allows easy compilation for different target platforms. Currently binary executables were produced and tested on Windows (XP, 7) and Ubuntu Linux (GTK2). For developers: there are two units listed... -
3
Flatbush
A very fast static spatial index for 2D points and rectangles in JS
A really fast static spatial index for 2D points and rectangles in JavaScript. An efficient implementation of the packed Hilbert R-tree algorithm. Enables fast spatial queries on a very large number of objects (e.g. millions), which is very useful in maps, data visualizations and computational geometry algorithms. -
4
Trilium Notes
Build your personal knowledge base
Trilium is provided as either desktop application (Linux and Windows) or web application hosted on your server (Linux). Mac OS desktop build is available, but it is unsupported. Synchronization with self-hosted sync server, strong note encryption with per-note granularity, relation maps and link maps for visualizing notes and their relations, and scripting, see Advanced showcases. Scales well in both usability and performance upwards of 100 000 notes, touch optimized mobile frontend for... -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
ANTLR
Parser generator to read, process, or translate structured text
ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files. It's widely used to build languages, tools, and frameworks. From a grammar, ANTLR generates a parser that can build and walk parse trees. It’s widely used in academia and industry to build all sorts of languages, tools, and frameworks. Twitter search uses ANTLR for query parsing, with over 2 billion queries a day. The languages for... -
6
This tool helps to optimize images (in batch) to their best quality given a constraint file size in KBs. It utilizes opensource tools such as imagemagick, with a modified binary search tree algorithm. Inspired by handbrake, it has been compiled for Windows 11 with Python 3.13.0 version. Most compatible for jpeg image files. See the intro video clip for how it works.
-
7
Swiss File Knife
One hundred command line tools in a small and portable binary.
Create zip files, extract zip files, replace text in files, search in files using expressions, stream text editor, instant command line ftp and http server, send folder via network, copy folder excluding sub folders and files, find duplicate files, run a command on all files of a folder, split and join large files, make md5 checksum lists of files, remove tab characters, convert CR/LF, list newest or biggest files of a folder, compare folders, treesize, show first or last lines of a file,... -
8
weight_matchers
Efficiently find items by matching weight in const lookup structure.
Efficiently find items by matching weight. If your data is static, you can build the lookup structure (a complete binary tree) at compile time, by making it `const`. You can use any inferred numeric type for the weights. You can have any range for the lookup, by default `0.0 .. 1.0` for floats, and their respective whole spectrum for unsigned integers. -
9
VR Paged List for C# and more
VR Paged List for C# and more
a collection of Vincent Radio {Adrix.NT} C# sources & build projects includes - Paged Lists & Iterators Library for C# - Multi Dimensional Array Library for C# - MDArray List Manager Library for C# - Adjacency (List | Matrix) Direct Graph Libs for C# - Range Check functions - VRMosaic (WinForms) - with Auto Resolver also includes - Source Files - Visual Studio Build Projects - Test Applics have fun adrixnt@hotmail.it -
Forever Free Full-Stack Observability | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
VR Ax Java Sources & Build Projects
VR Adrix Java Works - Paged Lists - Action-Entity Model ...
Adrix.NT Java Works :: Sources & Build Projects includes - Paged Lists of Object & Iterators Library for Java - Action / Entity Model for Java - VR Ax AWT Clock Java Component - VR Multi Dimensions Array Library - VR MDArray List Manager Library - VR Adjacency (List | Matrix) Direct Graph Lib - VRJMosaic cells sliding game with automatic resolver - VR RectsWorld Sample Applic - VR Free Chess 2D Applic also contains - Other Utils Libraries - Demo and Test Applications -... -
11
Delphi : VRCalc++ OOSL (Script) and more
Delphi : VRCalc++ OOSL & + (Paged List, TextEditor, VRAstroVision ...)
Vincent Radio {Adrix.NT} Sources Library & Applications : Delphi C++ Java VRCalc++ C# VRCalc++ Object Oriented Scripting Language - Engine Source Pascal Code - Delphi Packages Build Prjs - VRCalc++ Scripted System Std RT Library - Guides & Docs (CHM, PDF, DOCX) - VCL & FMX (FireMonkey) Support - Script Test Code (Lang RTL VCL FMX) - Visual Stage Project : VCL & FMX Paged Lists & Iterators : Delphi C++ Java C# Multi-Dim Arrays & Direct Graph Classes : Delphi C++ Java VRCalc++... -
12
Elementary Algorithms
Book of elementary algorithms and data structures
This book introduces elementary algorithms and data structure. It includes side-by-side comparison of purely functional realization and their imperative counterpart. From 2020/12, I started re-writing this book. The PDF can be downloaded for preview (EN, 中文). The 1st edition in Chinese (中文) was published in 2017. I recently switched my focus to the Mathematics of programming, the new book is also available in (github). To build the book in PDF format from the sources, you need the following... -
13
Binarytree
Python library for studying Binary Trees
Binarytree is Python library that lets you generate, visualize, inspect and manipulate binary trees. Skip the tedious work of setting up test data, and dive straight into practicing algorithms. Heaps and BSTs (binary search trees) are also supported. Binarytree supports another representation which is more compact but without the indexing properties. Traverse trees using different algorithms. -
14
StructPie
A set of C libraries to implement data structures and algorithms
Struct-Pie (Structures Pie) is a set of C shared libraries to implement data structures and algorithms so that they can be used/integrated easily into C projects. LIFO & FIFO Stack, Binary Search Tree, Priority Queue and a Hash Table are implemented and included in this package. Future releases will have many other data structures. The hash table in this package uses separate chaining to avoid collision. In the "hash_table" directory, the hash table implementation uses linked lists. While in "HashBSTree" directory, a hash table with a binary tree in each index is implemented for faster lookup in large data. ... -
15
Buckets
A complete, fully tested and documented data structure library
A complete fully tested and documented data structure library written in pure JavaScript. Buckets also includes several functions for manipulating arrays. A bag is a special kind of set in which members are allowed to appear more than once. Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search. Dictionaries map keys to values, each key can map to at most one value. A heap is a binary tree that maintains the heap property. Every node is less than or equal to each of its children. A linked list is a sequence of items arranged one after another. ... -
16
Java DSA extensions
Java datastructures and algorithms extensions
DSA extensions contains classes similar in purpose to the classes provided in java.util. Currently, it contains sortable Lists and Maps, as well as a balanced binary search tree and a binary array search algorithm. -
17
cdsaext
C DSA extensions
cdsaext is a library of implementations of data structures and algorithms, such as lists, maps, trees, binary search functions, and similar dsa's. See also my javadsaext project, which implements similar functions in Java. -
18
DeaDBeeF Filebrowser plugin
A filebrowser plugin for the DeaDBeeF audio player.
A filebrowser plugin for the DeaDBeeF audio player, see: http://deadbeef.sf.net The plugin is placed in a sidebar inside the main user interface, and shows a simple list of files/folders inside a user-defined root directory. It supports adding files to playlists by context menu or drag and drop. It also uses coverart images as folder icons, and implements a search bar feature that allows you to filter the list of shown files. BUG REPORTS Please report bugs/feature requests on GitLab: https://gitlab.com/zykure/deadbeef-fb/issues RELEASE FILES Release files (binary/source) are available on GitLab: https://gitlab.com/zykure/deadbeef-fb/tree/release Older releases can also be found here on SourceForge. ... -
19
It is a C# library that implementes most binary tree algorithms such as insertion algorithm, deletion algorithms, and searching a node in a binary search tree. It also can conduct the preorder and postorder traversal functions.
-
20
CLAW is a C++ Library providing various tools in different domains, like a Tweener framework, Bézier curves manipulation, a map with multiple value types, a binary search tree container implemented as an AVL and an implementation of the sockets as std::stream. The library also includes a set of classes to easily load and write png, jpeg, gif files and other image formats. Finally, a part of the library is devoted to artificial intelligence in games and includes a generic alpha-beta algorithm. ...
-
21
Binary search tree
Binary Search Tree in c++
Binary Search Tree is a binary tree in which the nodes can have at most 2 childrens. The childrens are differenciated such that the left chile is lesser than parent and right child is greater than parent. P / \ (LC < p) / \ (RC > p) / \ LC RC -
22
libssdi
Data structure library
Library to implement popular data structures in C which doesn't need any modification to existing structures. SSDI stands for Store, Search, Delete, Iterate. Data structures which implement these will be added in this. Inspired by the ease in which a list can be created in Perl. Hope to bring such easy programmability using this library. Currently, sorted linked list, binary tree, AVL tree are implemented. Packaging not implemented. -
23
Occursions
Fast customizable time series web database for big data like log files
Our goal is to create the world's fastest extendable, non-transactional time series database for big data (you know, for kids)! Log file indexing is our initial focus. For example append only ASCII files produced by libraries like Log4J, or containing FIX messages or JSON objects. Occursions was built by a small team sick of creating hacks to remotely copy and/or grep through tons of large log files. We use it to index around a terabyte of new log data per day. You can use it too. Who... -
24
An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes
-
25
Large image database navigating system. Uses Binary Threeshold Histogram and Browsing/Navigation based on Binary Search Tree system to navigate through and retrieve images from the database.
