depth-first tree
Смотреть что такое "depth-first tree" в других словарях:
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
depth-first search — noun an algorithm for traversing a tree or graph where one starts at the root nad explores as far as possible along each branch before backtracking … Wiktionary
Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Depth-limited search — Class Search Algorithm Data structure Graph Worst case performance O( | V | + | E | ) … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Tree walking automaton — A tree walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings.The following article deals with tree walking automata. For a different notion of tree automaton, closely related to regular tree… … Wikipedia
First Battle of Maryang San — Part of the … Wikipedia
Tree hollow — A tree hollow or tree hole is a semi enclosed cavity which has naturally formed in the trunk or branch of a tree. These are predominantly found in old trees, whether living or not. Hollows form in many species of trees, and are a prominent… … 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
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… … Wikipedia
