Everything about Finger tree
Purely functional data structure
In computer science, a finger tree is a purely functional data structure that can be used to efficiently implement other functional data structures. A finger tree gives amortized constant time access to the "fingers" (leaves) of the tree, which is where data is stored, and concatenation and splitting logarithmic time in the size of the smaller piece. It also stores in each internal node the result of applying some associative operation to its descendants. This "summary" data stored in the internal nodes can be used to provide the functionality of data structures other than trees. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Finger treeA 5-minute orientation
- Skim a recent paper: Global field observations of tree die-off reveal hotter-drought fingerprint for Earth’s forestsInfluential work since 2022
- Pick up a classic book: Les trois MousquetairesThe most-reprinted book on the subject
- Read the landmark paper: A constant update time finger search treeCited 17 times
- Go sideways: Splay treeA closely related topic
- Go sideways: Disjoint-set data structureA closely related topic
📖 Definitions
Noun A purely functional tree-like data structure offering amortized constant time access to its "fingers" (leaves), used for the efficient implementation of other purely functional data structures.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A constant update time finger search tree
Logistic regression tree applied to classify PCB golden finger defects
Finger-vein recognition with modified binary tree model
Assessment of Tree-Based Statistical Learning to Estimate Optimal Personalized Treatment Decision Rules for Traumatic Finger Amputations
Non-negative locality-constrained vocabulary tree for finger vein image retrieval
Finger Vein Representation by Modified Binary Tree Model
Blindness and the finger cherry tree
Tree-based hierarchical fusion network for multimodal finger recognition
🆕 Influential since 2022
Global field observations of tree die-off reveal hotter-drought fingerprint for Earth’s forests
Finger Movement Recognition using Machine Learning Algorithms with Tree-Seed Algorithm
Nutrient Compositions, Antioxidant Capacity and Biological Activities of Five-finger Tree (Averrhoa carambola) Stem bark, Root, Leaf and Fruit
📚 Books worth reading
Les trois MousquetairesAlexandre Dumas · 1844- 📕Tattoo Coloring Book for AdultsJenny Olsen · 2020
Atoms of empireC. J. Cutcliffe Hyne · 1904
Amphibian (DK Eyewitness Books)Barry Clarke · 1993
The Scary BookJoanna Cole, Stephanie Calmenson · 1991
Finger-ring loreJones, William. · 1877
Move over, Mother Goose!Ruth I. Dowell · 1987
The Whisper (The Roar #2)Emma Clayton · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Splay tree A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary…
- Disjoint-set data structure In computer science, a disjoint-set data structure, also called a union–find data structure or merge–find set, is a data structure that stores a collection…
- Potential method In computational complexity theory, the potential method is a method used to analyze the amortized time and space complexity of a data structure, a measure…
- Fibonacci heap In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a better…
- Pairing heap A pairing heap is a type of heap data structure with relatively simple implementation and excellent practical amortized performance, introduced by Michael…
- Procedural parameter In computing, a procedural parameter is a parameter of a procedure that is itself a procedure. This allows programmers to modify certain steps of a library…
- Link/cut tree A link/cut tree is a data structure for representing a forest, a set of rooted trees, and offers the following operations: Add a tree consisting of a single…
- AVL tree In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights…