- search tree
-
Google came up with a red-black tree, a balanced binary search tree that has quite fast insert and delete operations and is always sorted.
Wikipedia foundation.
search tree
Look at other dictionaries:
search tree — paieškos medis statusas T sritis informatika apibrėžtis ↑Medis, naudojamas duomenų paieškai. Vidiniuose medžio mazguose laikomi ↑raktai (1), rodantys į atitinkamame ↑pomedyje esančius raktus. Dažnai naudojamas paieškai ↑duomenų bazėje.… … Enciklopedinis kompiuterijos žodynas
Search Tree — A structure for representing steps made by an expert to evaluate a situation and arrive at a solution … International financial encyclopaedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Ternary search tree — In computer science, a ternary search tree (trie,TST) is a ternary (three way) tree data structure which combines the time efficiency of digital tries with the space efficiency of binary search trees. The resulting structure is faster than… … Wikipedia
Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… … Wikipedia
Randomized binary search tree — A randomized binary search tree (abbreviated RBST, also known as Cartesian tree) is a type of binary search tree, with data nodes organizedas in a normal binary search tree. Each node has also an access priority, namely p(n) which is chosen in a… … Wikipedia
Search algorithm — In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer… … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree … Wikipedia
