ordered+tree

См. также в других словарях:

• Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number …   Wikipedia

• Tree conservation areas in Singapore — Tree Conservation Areas are large urban areas in Singapore in which no tree with a girth above 1 metre when measured 50 centimetres from the ground may be felled without permission from the National Parks Board. There are currently two such areas …   Wikipedia

• Tree structure — A tree structure showing the possible hierarchical organization of an encyclopedia …   Wikipedia

• Tree (set theory) — In set theory, a tree is a partially ordered set (poset) ( T …   Wikipedia

• Tree (disambiguation) — A tree is a woody plant.Tree may also refer to: *Tree structure, a way of representing the hierarchical nature of a structure in a graphical form *Tree (data structure), a widely used computer data structure that emulates a tree structure with a… …   Wikipedia

• Tree (descriptive set theory) — In descriptive set theory, a tree on a set X is a set of finite sequences of elements of X that is closed under subsequences. More formally, it is a subset T of X^{ …   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 hugger — noun (disapproving) An environmental campaigner, especially one who aims to restrict logging. Lets go now, tree hugger, gasped one of them. The shows over. Everybody beat it, ordered the other. Syn: prairie fairy …   Wiktionary

• Interval tree — In computer science, an interval tree, also called a segment tree or segtree, is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is… …   Wikipedia

• Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

• Range tree — In computer science, a range tree is an ordered tree data structure to hold a list of points. It allows all points within a given range to be efficiently retrieved, and is typically used in two or higher dimensions. It is similar to a kd tree… …   Wikipedia