self-balancing-trees

There are 19 repositories under self-balancing-trees topic.

  • Crypto-toolbox/HFT-Orderbook

    Limit Order Book for high-frequency trading (HFT), as described by WK Selph, implemented in Python3 and C

    Language:C1k4816258

  • IvanPinezhaninov/IntervalTree

    A red-black self-balancing interval tree

    Language:C++29626

  • phillipberndt/bostree

    A C implementation of a self-balancing order statistic AVL tree

    Language:C17311

  • zwilias/elm-tree

    :deciduous_tree: Implementation of self-balancing trees in Elm

    Language:Elm430

  • btrekkie/RedBlackNode

    Java implementation of augmented red-black trees. Easily maintain custom augmentation information by subclassing RedBlackNode: the base class does the work for you.

    Language:Java3101

  • Henrik-Peters/Red-Black-Tree

    Generic red-black tree implementation for self-balancing binary search trees

    Language:C++3200

  • catherinewinslet/Student-course-library-using-Btree-File-structure

    The project is a menu-driven application for student courses database where the user is able to perform operations like adding a course, searching for a courses or deleting a course, etc.

    Language:C++2000

  • bondeje/dtlib

    A small package of basic data structures and algorithms; currently focusing on BinaryTrees and structures that utilize BinaryTrees. This is very much in development, but please take a look at the README.md and tell me what you think

    Language:Python1100

  • danieldotwav/Red-Black-Tree

    A short program that implements a Red-Black Tree in C++, offering a balanced binary search tree with operations for insertion, deletion, and traversal, ensuring optimal search times and balanced tree structure.

    Language:C++1101

  • anthony7586/Data-Structures

    Classical data structures: C++: vector, linked list, stack, queue, binary search tree, and graph representations. Worst-case analysis, amortized analysis, and big-O notation. Object-oriented and recursive implementation of data structures. Self-resizing vectors and self-balancing trees. Empirical performance measurement.

    0100

  • Biunovich/AVLTree

    Implementation of AVL tree in pure C.

    Language:C0200

  • Daksh2060/avl-tree-text-analyzer

    A C++ project implementing a self-balancing AVL tree for efficient word frequency counting. This program analyzes text files, finds unique words, tracks word occurrences, and prints results in alphabetical order for ease of viewing.

    Language:C++0100

  • FcoManueel/self-balancing-tree

    B+ self-balancing tree implementation using C++

    Language:C++0200

  • georgi2012/AVL_SkipList_Comparison

    Project to show performance comparison of AVL tree against SkipList in different cases

    Language:C++0100

  • varunnayal15112/Optimized-Phone-Directory

    Created a Phone Directory using AVL tree (self-balancing tree) in C++ using File Handling to store the Phone Numbers.

    Language:C++0100

  • aklsh/self-balancing-tree

    Implementing self-balancing trees with AVL Trees.

    Language:C++10

  • deepaktiwari88/Self-Balancing-BSTs

    A self-balancing binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels below the root) small in the face of arbitrary item insertions and deletions.

    Language:C++00

  • federicoB/RedBlackTree

    self-balancing binary research tree

    Language:Java301

  • xzheng97/safe_malloc

    This program is a special version of the malloc and free library routines that checks on common heap allocation and usage mistakes.

    Language:C10