Quote: threaded binary tree for detection and correction of errors: link null-pointers in a special way

Note

chained and threaded binary tree (2-detectable, 1- correctable storage structure for binary trees): null right links are threaded by in-order successor (see Knuth), null left-links link null left- link nodes together.

Related Topics

Topic: defensive programming (22 items)
Topic: trees (21 items)