11. Binary search trees are the most simplest, yet most common type of tree for this implementation.12. In 1983, Eppinger won the George E . Forsythe Award for his research in binary search trees . 13. The worst-case behaviour can be improved upon by using a self-balancing binary search tree . 14. I'm implementing a binary search tree in D with a Node class and a BinaryTree class. 15. AVL trees and red-black trees are two examples of binary search trees that use the left rotation. 16. All normal operations on a binary search tree are combined with one basic operation, called " splaying ". 17. In addition, and like all binary search trees , self-balancing binary search trees keep their elements in order. 18. In addition, and like all binary search trees, self-balancing binary search trees keep their elements in order. 19. Because random binary search trees are known to have logarithmic height with high probability, the same is true for treaps. 20. Searching for an item in a 2 3 tree is similar to searching for an item in a binary search tree .
