References


== External links ==
But because of how the linkage is set up to refer back to the sentinel, the code just works for empty lists as well, where curnode will be the sentinel node. Search in a binary tree
General declarations, similar to article Binary search tree:

The globally available pointer sentinel to the single deliberately prepared data structure Sentinel = *sentinel is used to indicate the absence of a child. Note that the pointer sentinel has always to represent every leaf of the tree. This has to be maintained by the insert and delete functions. It is, however, about the same effort as when using a NULL pointer. Remarks
With the use of SearchWithSentinelnode searching loses the R/O property. This means that in applications with concurrency it has to be protected by a mutex, an effort which normally exceeds the savings of the sentinel. SearchWithSentinelnode does not support the tolerance of duplicates. There has to be exactly one “node” to be used as sentinel, but there may be extremely many pointers to it. See also
Sentinel value
Magic number (programming)
Magic string
Null object pattern
Time formatting and storage bugs
Elephant in Cairo
Canary value
Semipredicate problem


== References ==