- bottom node
-
концевой узел
Англо-русский словарь технических терминов. 2005.
bottom node
Смотреть что такое "bottom node" в других словарях:
Shield of the Trinity — The Shield of the Trinity or Scutum Fidei is a traditional Christian visual symbol which expresses many aspects of the doctrine of the Trinity, summarizing the first part of the Athanasian Creed in a compact diagram. In medieval England and… … Wikipedia
2-3-4 tree — A 2 3 4 tree (also called a 2 4 tree), in computer science, is a self balancing data structure that is commonly used to implement dictionaries. 2 3 4 trees are B trees of order 4; like B trees in general, they can search, insert and delete in… … Wikipedia
Computational phylogenetics — is the application of computational algorithms, methods and programs to phylogenetic analyses. The goal is to assemble a phylogenetic tree representing a hypothesis about the evolutionary ancestry of a set of genes, species, or other taxa. For… … Wikipedia
Peperomia — taxobox name = Peperomia image caption = Peperomia with flower spikes in Costa Rica regnum = Plantae unranked divisio = Angiosperms unranked classis = Magnoliids ordo = Piperales familia = Piperaceae genus = Peperomia genus authority = Ruiz Pav.… … Wikipedia
Binary heap — Example of a complete binary max heap Example of a complete binary min heap A binary … Wikipedia
eclipse — eclipser, n. /i klips /, n., v., eclipsed, eclipsing. n. 1. Astron. a. the obscuration of the light of the moon by the intervention of the earth between it and the sun (lunar eclipse) or the obscuration of the light of the sun by the intervention … Universalium
sound — sound1 soundable, adj. /sownd/, n. 1. the sensation produced by stimulation of the organs of hearing by vibrations transmitted through the air or other medium. 2. mechanical vibrations transmitted through an elastic medium, traveling in air at a… … Universalium
Stack (data structure) — In computer science, a stack is an abstract data type and data structure based on the principle of Last In First Out (LIFO) . Stacks are used extensively at every level of a modern computer system. For example, a modern PC uses stacks at the… … Wikipedia
Linked list — In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence. Under the simplest form, each node is composed of a datum and a reference (in other words, a link) to the next node in the… … Wikipedia
Cograph — The Turán graph T(13,4), an example of a cograph In graph theory, a cograph, or complement reducible graph, or P4 free graph, is a graph that can be generated from the single vertex graph K1 by complementation and disjoint union. That is, the… … Wikipedia
celestial mechanics — the branch of astronomy that deals with the application of the laws of dynamics and Newton s law of gravitation to the motions of heavenly bodies. [1815 25] * * * Branch of astronomy that deals with the mathematical theory of the motions of… … Universalium
