31. Linked data structures include linked lists, search trees , expression trees, and many other widely used data structures. 32. In addition, and like all binary search trees , self-balancing binary search trees keep their elements in order. 33. In 1983, Eppinger won the George E . Forsythe Award for his research in binary search trees . 34. These two representatives point to two balanced binary search trees , which one both searches for " k ". 35. All normal operations on a binary search tree are combined with one basic operation, called " splaying ". 36. In many situations, hash tables turn out to be more efficient than search trees or any other sets. 37. However, ternary search trees are more space efficient compared to standard prefix trees, at the cost of speed. 38. Most chess engines use a transposition table in which the relevant part of the search tree is stored. 39. In addition to the requirements imposed on a binary search tree the following must be satisfied by a 40. Each of the two new balanced binary search trees contains at most log " M " + 1 elements.
