Live briefing
Everything about Binary tree
Limited form of tree data structure
In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. That is, it is a k-ary tree where k = 2. A recursive definition using set theory is that a binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton (a single–element set) containing the root. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Binary treeA 5-minute orientation
- Skim a recent paper: Multi-Label Classification Using Binary Tree of ClassifiersInfluential work since 2022
- Pick up a classic book: Abstract datatypes in PVSThe most-reprinted book on the subject
- Read the landmark paper: Multidimensional binary search trees used for associative searchingCited 5,925 times
- Go sideways: Tree traversalA closely related topic
- Go sideways: Leftist treeA closely related topic
📖 Definitions
Noun A data structure in which each node has at most two children, each node but the root has one parent, and there are no cycles.
🏆 Landmark papers (most cited)
Multidimensional binary search trees used for associative searching
Binary tree-inspired digital dendrimer
Fault Tolerance in Binary Tree Architectures
Binary search tree image encryption with DNA
A practical concurrent binary search tree
Multiple binary decision tree classifiers
Adaptation Algorithms for Binary Tree Networks
Binary tree versus single level tree classification of white blood cells
🆕 Influential since 2022
Multi-Label Classification Using Binary Tree of Classifiers
New binary-addition tree algorithm for the all-multiterminal binary-state network reliability problem
Empirical Variational Mode Decomposition Based on Binary Tree Algorithm
Binary tree approach to template placement for searches for gravitational waves from compact binary mergers
Fuzzy Option Pricing Based on Fuzzy Number Binary Tree Model
📚 Books worth reading
- 📕Abstract datatypes in PVSSam Owre · 1997
Binary decision diagramsRolf Drechsler · 1998
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Tree traversal In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting…
- Leftist tree In computer science, a leftist tree or leftist heap is a priority queue implemented with a variant of a binary heap. Every node x has an s-value which…
- Treap In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain…
- 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…
- Binary search tree In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each…
- Tree (abstract data type) In computer science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node…
- Search tree In computer science, a search tree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a search…
- Smoothsort In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981…