- rooted tree
- корневое дерево, дерево с корнем
Большой англо-русский и русско-английский словарь. 2001.
rooted tree
Смотреть что такое "rooted tree" в других словарях:
Deep Rooted Tree — Also known as 뿌리깊은 나무 Tree With Deep Roots Genre Crime History Format Television series Written by Kim Young hyun Park Sang yun Lee Jeong myeong (original novel) … Wikipedia
Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number … Wikipedia
Rooted graph — In mathematics, and, in particular, in graph theory, a rooted graph is a mathematical graph in which one node is labelled in a special way to distinguish it from the graph s other nodes. This special node is called the root of the graph.The… … Wikipedia
Tree worship — (dendrolatry) refers to the tendency of many societies throughout history to worship or otherwise mythologize trees. Trees have played an important role in many of the world s mythologies and religions, and have been given deep and sacred… … Wikipedia
Rooted in Ireland — is an oak planting project in County Armagh, Northern Ireland. The project plants oak trees, and then offers them for sale to interested parties around the world, as gifts etc. The project is affiliated with Marie Curie Cancer Care,and 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 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
Tree (set theory) — In set theory, a tree is a partially ordered set (poset) ( T … Wikipedia
Rooted product of graphs — In mathematical graph theory, the rooted product of a graph G and a rooted graph H is defined as follows: take | V ( G )| copies of H , and for every vertex v i of G , identify v i with the root node of the i th copy of H .More formally, assuming … Wikipedia
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
rooted — adjective a) Fixed in one position; immobile; unable to move. She stayed rooted in place. b) Of a tree, having a root. I am absolutely rooted if Ferris finds out about this … Wiktionary
