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 16:17, 13 May 2008 (Signing comment by 128.84.24.187 - "Diagram: "). 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]

"This is possible, because if a node (k) has a right child (m) then m's left pointer must be either a child, or a thread back to k" Isn't that not true for node H in the diagram? Node H has no right child but its right->left linked back to itself. —Preceding unsigned comment added by 128.84.24.187 (talk) 16:16, 13 May 2008 (UTC)[reply]