Implementation of Algorithms and Data Structures, Problems and Solutions

Python Library for Studying Binary Trees

A complete, fully tested and documented data structure library written in pure JavaScript.

leetcode.com , algoexpert.io solutions in python and swift

🚀Everything you need to know to find an android job. 算法 / 面试题 / Android 知识点 🔥🔥🔥 总结不易，你的 star 是我最大的动力！

IP geolocation binary tree search

Some operations for binary tree

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

Safe, fallible, embedded-friendly ordered set/map via a scapegoat tree. Validated against BTreeSet/BTreeMap.

This repo contains solutions to problem of data structures in c++

TypeScript & Javascript Data Structures

BokkyPooBah's Red-Black Binary Search Tree Library

Coursera's Data Structures and Algorithms Specialization

Code and lessons from "30 Days Of Code" put together by @BlondieBytes. Topics include variables, methods, binary search trees and more. It is a general, yet thorough, introduction to Java.

Data Structures with Go Language

Data-Structures using C++.

InterviewBit Programming Solutions

Code from Youtube Tutorial Series

Contains the solutions for the programming questions in the CodingNinjas Java+DSA course

Fast splay-tree data structure

I've written some important Algorithms and Data Structures in an efficient way in Java with references to time and space complexity. These Pre-cooked and well-tested codes help to implement larger hackathon problems in lesser time. DFS, BFS, LCA, LCS, Segment Tree, Sparce Table, All Pair Shortest Path, Binary Search, Matching and many more ...

:eyeglasses: Fast AVL tree for Node and browser

缓存cache服务器

Basic data structures, sorting algorithms, algorithms learning tools. 基本数据结构，排序算法，算法学习工具

Lua algorithms library that covers commonly used data structures and algorithms

Pure Python implementation of d-dimensional AABB tree.

Our main objective in this project is to create a library management system wherein students can issue books and the admin or librarian can update/delete the record of books kept in the library. So we have the system into two parts : from user’s perspective and from admin’s perspective. First of all, the admin must login to handle the accounts where the username and password are already set. After he has logged in successfully, he can add, delete and update the books. He can add any new book in the already existing list of books. Similarly he can also delete any existing book. In the update option, the admin can update the quantity of books as well as the name of the book. As and when the admin adds the books, a binary search tree will be created where the nodes contain the name of books and are put in sorted order. Now if a student wants to issue/return any book, then he/she must login into the system, by enetering their valid university ID. The student will be allowed to issue/return only if their ID matches the list of university ID’s of students. When the student enters the name of book to be issued, that particular book will be searched by it’s name, in the already created binary search tree. If the book is not found in the tree, then a message will be printed “Book is not available in the library”. And if the book is out of stock, then this message will be printed, “This book is currently unavailable. Please try after some days.” Moreover, the student cannot issue more than 2 books simultaneously. When the student issues a book, the issuing date and time is recorded by the librarian. And if the student misses the due date of returning the book, then he has to pay that particular fine.

A repository containing link of good interview questions

DataStructures and algorithms

🔗 Common Data Structures and Algorithms