|
algorithms
|
|
|
|
|
Bookmarks
|
|
|
|
|
|
|
|
|
A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node, and all left child pointers that would normally be null point to the inorder predecessor of the node."
http://en.wikipedia.org/wiki/Threaded_binary_tree
saved under Data Structures/Trees/Threaded
by
algorithms
|
|
|