Talk:Threaded binary tree

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing  
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.
 

Diagram[edit]

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[edit]

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)

File:Normal BInary Tree.gif Nominated for speedy Deletion[edit]

Image-x-generic.svg

An image used in this article, File:Normal BInary Tree.gif, has been nominated for speedy deletion for the following reason: All Wikipedia files with unknown copyright status

What should I do?

Don't panic; you should have time to contest the deletion (although please review deletion guidelines before doing so). The best way to contest this form of deletion is by posting on the image talk page.

  • If the image is non-free then you may need to provide a fair use rationale
  • If the image isn't freely licensed and there is no fair use rationale, then it cannot be uploaded or used.
  • If the image has already been deleted you may want to try Deletion Review

This notification is provided by a Bot --CommonsNotificationBot (talk) 17:08, 9 September 2011 (UTC)

File:Threaded Binary Tree.gif Nominated for speedy Deletion[edit]

Image-x-generic.svg

An image used in this article, File:Threaded Binary Tree.gif, has been nominated for speedy deletion for the following reason: All Wikipedia files with unknown copyright status

What should I do?

Don't panic; you should have time to contest the deletion (although please review deletion guidelines before doing so). The best way to contest this form of deletion is by posting on the image talk page.

  • If the image is non-free then you may need to provide a fair use rationale
  • If the image isn't freely licensed and there is no fair use rationale, then it cannot be uploaded or used.
  • If the image has already been deleted you may want to try Deletion Review

This notification is provided by a Bot --CommonsNotificationBot (talk) 17:08, 9 September 2011 (UTC)

Example diagram needs to be updated[edit]

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[edit]

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)