Operations
Operations on a binary search tree require comparisons between nodes. These comparisons are made with calls to a comparator, which is a subroutine that computes the total order (linear order) on any two keys. This comparator can be explicitly or implicitly defined, depending on the language in which the BST is implemented.
Read more about this topic: Binary Search Tree
Famous quotes containing the word operations:
“There is a patent office at the seat of government of the universe, whose managers are as much interested in the dispersion of seeds as anybody at Washington can be, and their operations are infinitely more extensive and regular.”
—Henry David Thoreau (1817–1862)
“You can’t have operations without screams. Pain and the knife—they’re inseparable.”
—Jean Scott Rogers. Robert Day. Mr. Blount (Frank Pettingell)
“Plot, rules, nor even poetry, are not half so great beauties in tragedy or comedy as a just imitation of nature, of character, of the passions and their operations in diversified situations.”
—Horace Walpole (1717–1797)