Jump to content

Talk:Threaded binary tree

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SineBot (talk | contribs) at 03:17, 13 December 2010 (Signing comment by 117.211.83.26 - "some common knowledge: "). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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)[reply]

Someone else took care of it. Great job. :-) Dcoetzee 22:55, 15 February 2008 (UTC)[reply]

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)[reply]

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)[reply]

Headline text

hello —Preceding unsigned comment added by 59.93.123.250 (talk) 08:23, 9 April 2010 (UTC)[reply]