tree depth
Смотреть что такое "tree depth" в других словарях:
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Depth-first search — Order in which the nodes are visited Class Search algorithm Data structure Graph Worst case performance … Wikipedia
Depth-limited search — Class Search Algorithm Data structure Graph Worst case performance O( | V | + | E | ) … Wikipedia
Tree (Unix) — Tree is a program available for Unix and Unix like systems. tree is a recursive directory listing program that produces a depth indented listing of files. With no arguments, tree lists the files in the current directory. When directory arguments… … 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 (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 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
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
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
And–or tree — An and–or tree is a graphical representation of the reduction of problems (or goals) to conjunctions and disjunctions of sub problems (or sub goals). ExampleThe and or tree:represents the search space for solving the problem P, using the goal… … 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
