Talk:Threaded binary tree

Diagram
This article needs a cell-arrow diagram like the other tree and linked list articles have. On my to-do list. Dcoetzee 04:57, 11 February 2008 (UTC)
 * Someone else took care of it. Great job. :-) Dcoetzee 22:55, 15 February 2008 (UTC)

threaded binary tree is presented by "Thornton" and "Perlis". It is use full because simple binary tree has more than half of pointer areas with NULL. That is a memory wastage. To over come this problem threaded binary tree is used. —Preceding unsigned comment added by 117.211.83.26 (talk) 03:16, 13 December 2010 (UTC)

The Definition
The definition given in the article is not generalized. It is the definition of an in-threaded binary tree. The leaf nodes in threaded binary tree are capable of pointing to any other node. Different rules of tree pointing (of leafs) result in different types of threaded binary trees viz. in-threaded, pre-threaded, etc. Ajinx999 (talk) 23:57, 11 December 2009 (UTC)

Example diagram needs to be updated
I think there is a 'thread' missing in the diagram: http://en.wikipedia.org/wiki/File:Threaded_Binary_Tree.png

There should be a blue pointer from 'E' to 'A'. How can I update this image? Panditsurabhi (talk) 16:56, 21 April 2013 (UTC)

The non-recursive explanation still uses a visited list
If you keep track of what type of link was the last link you followed, then the algorithm no longer needs this list. Essentially change the "iff we haven't visited it earlier" to "iff we followed a normal link to the current node." I can make this change and modify the table that follows the explanation, if there are no objections. — Preceding unsigned comment added by 2601:8:9A00:EC0:A89D:3B7F:6FE5:2742 (talk) 21:17, 7 December 2014 (UTC)

India Education Program course assignment
This article was the subject of an educational assignment at College Of Engineering Pune supported by Wikipedia Ambassadors through the India Education Program&#32;during the 2011 Q3 term.&#32;Further details are available on the course page.

The above message was substituted from by PrimeBOT (talk) on 20:08, 1 February 2023 (UTC)