2006-09-28 05:42:20 · 18 answers · asked by scoobybird2003 2 in Education & Reference ➔ Trivia
"Tree" comes from Old English treo, treow "tree" (also "wood"), and that comes from *trewan (cf. Old Frisian. tre, So the word came over with the Angles, Saxons and Jutes after the fall of the Roman empire.
2006-09-28 05:48:29 · answer #1 · answered by halifaxed 5 · 1⤊ 0⤋
In computer science, a tree is a widely-used computer data structure that emulates a tree structure with a set of linked nodes. It is a special case of a graph. Each node has zero or more child nodes, which are below it in the tree (by convention in computer science, trees grow down - not up as they do in nature). A node that has a child is called the child's parent node (or ancestor node, or superior). A child has at most one parent.
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 all operations on the tree begin. 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.
A subtree is a portion of a tree data structure that can be viewed as a complete tree in itself. Any node in a tree T, together with all the nodes below it, comprise a subtree of T. The subtree corresponding to the root node is the entire tree; the subtree corresponding to any other node is called a proper subtree (in analogy to the term proper subset).
Nodes at the bottom most level of the tree are called leaf nodes. Since they are at the bottom most level, they will not have any children. An internal node or inner node is any node of a tree data structure that has child nodes and is thus not a leaf node.
In graph theory, a tree is a connected acyclic graph. A rooted tree is such a graph with a vertex singled out as the root. In this case, any two vertices connected by an edge inherit a parent-child relationship. An acyclic graph with multiple connected components or a set of rooted trees is sometimes called a forest.
2006-09-28 05:49:28 · answer #2 · answered by Anonymous · 0⤊ 0⤋
The name came from Olde English but I have no clue what it meant.
They probably called it a tree because Bush as a name was already taken.
2006-09-28 05:45:56 · answer #3 · answered by Rich Z 7 · 0⤊ 0⤋
A tree is called a tree because it couldn't be called a arvore...
2006-09-28 05:45:12 · answer #4 · answered by Hacker 3 · 0⤊ 0⤋
A tree is called a tree simply because your mom didnt work out. both ways if you know what I mean
2006-09-28 05:49:53 · answer #5 · answered by Kiley R 1 · 0⤊ 0⤋
Is it really necessary to understand why a tree is named a tree??? But anyways i suppose it is derived from some prehistoric language or something
2006-09-28 06:48:23 · answer #6 · answered by kittykat42 2 · 0⤊ 0⤋
The same reason a house is called a house
2006-09-28 05:58:42 · answer #7 · answered by amber_xx66 4 · 1⤊ 0⤋
well if it was the same name as a flower or pond, or seed, etc......then we wouldnt know why they are called the same thing, so thats why there are diff. names for diff. things like trees.
2006-09-28 05:56:55 · answer #8 · answered by fryeindustries2002 3 · 1⤊ 0⤋
Maybe it's a cut down from having to say 'trunk,branches&leaves
2006-10-01 14:57:12 · answer #9 · answered by BLACKY 4 · 0⤊ 0⤋
Because thats what it is, its like why is a question called a question same answer because it is.
2006-09-28 05:45:55 · answer #10 · answered by carla s 4 · 0⤊ 0⤋