JavaScript implements stack of data structures, queues and double-ended queues, linked lists, collections, dictionaries and hash tables, recursion, trees, binary trees and heap sorting, graphs
Analysis of a series of problems concerning the intersection of two singly linked lists, given two singly linked lists that may have rings or acycles,...
This article is the 1.8 version of the HashMap source code analysis, including hash function, perturbation function, capacity development, red-black tree balance principle, linked list...
This article is the 1.8 version of ArrayList source code parsing, this article contains transient, serialVersionUID, shallow copy, reflection element creation, expansion logic, fail-fast mechanism,...
The parsing of this article is based on JAVA8. Due to the complex internal mechanism of HashMap, this chapter introduces the calculation process of HashMap...
Today we learned about circular queues, which use continuous space and take mod operations to realize the loop, thereby reducing the waste of space. Please...
Heap this kind of data structure application scenario is many, the most classic is heap sort. Heapsort is an O(nlogn) in place sorting algorithm. Today...
This article introduces the "linked list" structure and uses JS code to implement the corresponding structure. A linked list is a data structure composed of...
We learned from the previous article, binary Search Trees, that binary search trees don't meet our query performance requirements in extreme cases. Some statistical properties...
Overview Balanced binary trees, also known as AVL trees, are a structural feature derived to optimize the extreme cases of sorting binary trees (from small...
Introduction Red black tree, B tree, B+ tree, is a relatively difficult to understand and master the knowledge points in software development. Their essence is...