31. In other words, it allows for a backjump only at leaf nodes in the search tree. 32. These are usually the ultrapeers of a leaf node and they are announced in search results. 33. The algorithm evaluates each " leaf node " using a heuristic evaluation function, obtaining the values shown. 34. A leaf node , however, is a terminal node that does not dominate other nodes in the tree. 35. All insertions start at a leaf node . 36. Fault tree methodology employs boolean expressions to gate conditions when parent nodes are satisfied by leaf nodes . 37. Note : we define a location in an expression as a leaf node in the syntax tree. 38. Make the cuts just above leaf nodes . 39. Performing a radix sort with the buckets is like creating a trie and then discarding the non-leaf nodes . 40. NYT spawns two child nodes : 252 for NYT and 253 for leaf node , both with weight 0.
