Glossary entry (derived from question below)
Jan 9, 2008 11:59
16 yrs ago
English term
root node
English to Turkish
Tech/Engineering
Computers: Software
programming
this term is related to the feedback form.
Proposed translations
(Turkish)
5 | kök düğüm | Zeki Ilker Doğan |
4 +10 | kök düğüm | Istanbul Tra (X) |
4 | ana düğüm | barisozyurt |
Proposed translations
1 hr
Selected
kök düğüm
kök düğüm tam karşılığı. ana düğüm olarak kullanılmaz bu alanda
Note from asker:
teşekkürler |
1 KudoZ points awarded for this answer.
+10
3 mins
kök düğüm
kök düğüm
--------------------------------------------------
Note added at 5 mins (2008-01-09 12:04:40 GMT)
--------------------------------------------------
http://64.233.183.104/search?q=cache:cThr8Nl2xPYJ:www.emo.or...
--------------------------------------------------
Note added at 5 mins (2008-01-09 12:04:40 GMT)
--------------------------------------------------
http://64.233.183.104/search?q=cache:cThr8Nl2xPYJ:www.emo.or...
Note from asker:
teşekkür ederim |
Peer comment(s):
agree |
chevirmen
2 mins
|
teşekkür ederim
|
|
agree |
Gulay Baran
: kesinlikle
3 mins
|
teşekkür ederim
|
|
agree |
Feza Eruguz
8 mins
|
teşekkür ederim
|
|
agree |
Mehmet Hascan
27 mins
|
teşekkür ederim
|
|
agree |
ozan karakış
1 hr
|
teşekkür ederim
|
|
agree |
Serkan Doğan
22 hrs
|
teşekkür ederim
|
|
agree |
Nahit Karataşlı
: Root hakları olan (Unix ve tabi Linux)
23 hrs
|
teşekkür ederim
|
|
agree |
Taner Göde
1 day 18 hrs
|
teşekkür ederim
|
|
agree |
mustafa karabiber
2 days 19 hrs
|
teşekkür ederim
|
|
agree |
Ali Bayraktar
5 days
|
teşekkür ederim
|
38 mins
ana düğüm
ana düğüm
http://en.wikipedia.org/wiki/Tree_data_structure: The topmost node in a tree is called the root node. Being the topmost node, the root node will not have parents. It is the node at which operations on the tree commonly begin (although some algorithms begin with the leaf nodes and work up ending at the root). All other nodes can be reached from it by following edges or links. (In the formal definition, each such path is also unique). In diagrams, it is typically drawn at the top. In some trees, such as heaps, the root node has special properties. Every node in a tree can be seen as the root node of the subtree rooted at that node.
http://en.wikipedia.org/wiki/Tree_data_structure: The topmost node in a tree is called the root node. Being the topmost node, the root node will not have parents. It is the node at which operations on the tree commonly begin (although some algorithms begin with the leaf nodes and work up ending at the root). All other nodes can be reached from it by following edges or links. (In the formal definition, each such path is also unique). In diagrams, it is typically drawn at the top. In some trees, such as heaps, the root node has special properties. Every node in a tree can be seen as the root node of the subtree rooted at that node.
Note from asker:
teşekkürler, ama çoğunluk "kök düğüm" cevabını verdi |
Something went wrong...