Everything about Threaded binary tree

🧭 Start here: a 6-step reading path

1. Read the overview: Threaded binary treeA 5-minute orientation
2. Pick up a classic book: Computational Linguistics and Intelligent Text ProcessingThe most-reprinted book on the subject
3. Read the landmark paper: On deletion in threaded binary treesCited 7 times
4. Go sideways: Tree traversalA closely related topic
5. Go sideways: Binary search treeA closely related topic

🏆 Landmark papers (most cited)

• On deletion in threaded binary trees

  Keith Brinck · 1986 · Journal of Algorithms · 7 citations

• Threaded linear hierarchical quadtrees for computation of geometric properties of binary images

  A. Unnikrishnan, P. Shankar, Y.V. Venkatesh · 1988 · IEEE Transactions on Software Engineering · 5 citations

• Eliminating the flag in threaded binary search trees

  Dan Gordon · 1986 · Information Processing Letters · 4 citations

• Efficient algorithms to create and maintain balanced and threaded binary search trees

  S. Sitharama Iyengar, Hsi Chang · 1985 · Software: Practice and Experience · 3 citations

• A study of binary tree traversal algorithms and a tag-free threaded representation

  T.I. Fenner, G. Loizou · 1986 · International Journal of Computer Mathematics · 2 citations

• Computing parent nodes in threaded binary trees

  Keith Brinck · 1986 · BIT · 1 citations

• The Application of Bezier Curves about the Visualization of the Threaded Binary Tree

  Xiao Bo Yang, Bang Ze Chen · 2012 · Advanced Materials Research · 0 citations

• The new design of the threaded binary trees

  Da-Ke He · 1993 · International Journal of Computer Mathematics · 0 citations

📚 Books worth reading

• Computational Linguistics and Intelligent Text ProcessingAlexander Gelbukh · 2003
• An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
• Automate the Boring Stuff with PythonAl Sweigart · 2015
• Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
• Fundamentals of data structures in CEllis Horowitz · 1993
• An introduction to data structures with applicationsJean-Paul Tremblay, Paul Gordon Sorenson · 1976
• Schaum's outline of theory and problems of data structuresSeymour Lipschutz · 1986
• Data structures using C and C++Yedidyah Langsam · 2000

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…
• 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…
• 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…
• Binary tree 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…
• Recursion (computer science) In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same…
• 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…
• 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…
• M-ary tree In graph theory, an m-ary tree (for nonnegative integers m) (also known as n-ary, k-ary, k-way or generic tree) is an arborescence (or, for some authors…