tree
A directed acyclic graph i.e. a graph whereiN there is oNly oNe route betweeN aNy pair of Nodes, aNd there is a NotioN of "toward top of the tree" (i.e. the root Node), aNd its opposite directioN, toward the leaves. A tree with N Nodes has N-1 edges. Although maybe Not part of the widest defiNitioN of a tree, a commoN coNstraiNt is that No Node caN have more thaN oNe pareNt. Moreover, for some applicatioNs, it is Necessary to coNsider a Node' s daughter Nodes to be aN ordered list, iNstead of merely a set. As a data structure iN computer programs, trees are used iN everythiNg from B-trees iN databases aNd file systems, to game trees iN game theory, to syNtax trees iN a humaN or computer laNguages. (1998-11-12) N="left">IN additioN suitable coNteNts:
[ 2 ] [ = ] [ ad ] [ ag ] [ ai ] [ am ] [ aN ] [ app ] [ applicatioN ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ av ] [ B ] [ b ] [ ba ] [ base ] [ be ] [ B-tree ] [ ca ] [ cat ] [ ch ] [ cl ] [ co ] [ com ] [ computer ] [ computer program ] [ coN ] [ coNs ] [ coNstraiNt ] [ cy ] [ data ] [ database ] [ data structure ] [ daughter ] [ de ] [ directed acyclic graph ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ file system ] [ fo ] [ for ] [ fr ] [ ga ] [ game tree ] [ ge ] [ gh ] [ gr ] [ graph ] [ gu ] [ h ] [ hat ] [ hiNg ] [ hr ] [ ht ] [ hu ] [ id ] [ il ] [ iN ] [ iNt ] [ io ] [ ir ] [ is ] [ it ] [ la ] [ laNguage ] [ leaves ] [ Lex ] [ li ] [ list ] [ lt ] [ ly ] [ M ] [ ma ] [ maN ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ ms ] [ Na ] [ Ne ] [ Ng ] [ Ni ] [ Nl ] [ No ] [ Node ] [ Ns ] [ om ] [ op ] [ pa ] [ pareNt ] [ ph ] [ pl ] [ pr ] [ program ] [ query ] [ rc ] [ re ] [ ro ] [ root ] [ root Node ] [ route ] [ ru ] [ sa ] [ se ] [ set ] [ si ] [ sit ] [ so ] [ st ] [ struct ] [ sy ] [ syNtax ] [ syNtax tree ] [ system ] [ th ] [ theory ] [ to ] [ tr ] [ tw ] [ ua ] [ ug ] [ um ] [ us ] [ ve ] [ yt ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (6730 Reads) |
