Translations into Hebrew:
- עץ(Noun, Verb m)large woody plant (noun)chase up a treeA data structure containing zero or more nodes that are linked together in a hierarchy. If any nodes are present, one node is the root; each node except the root is the child of one and only one other node, and each node has zero or more nodes as children.Any large woody perennial plant with a distinct trunk giving rise to branches or leaves at some distance from the ground.chase up a tree
- אילנא(Noun )large woody plant (noun)
- עֵץ( m)Any large woody perennial plant with a distinct trunk giving rise to branches or leaves at some distance from the ground.large woody plant
- אילן( m)
pole with storage hooks (noun)
A device used to hold or stretch a shoe open.
(graph theory) A connected graph with no cycles or, equivalently, a connected graph with n vertices and n -1 edges.
shoe tree (noun)
The structural frame of a saddle.
(graphical user interface) A display or listing of entries or elements such that there are primary and secondary entries shown, usually linked by drawn lines or by indenting to the right.
The structure or wooden frame used in the construction of a saddle used in horse riding.
A large plant, not exactly defined, but typically over four meters in height, a single trunk which grows in girth with age and branches (which also grow in circumference with age).
Any plant that is reminiscent of the above but not classified as a tree in the strict botanical sense: for example the banana "tree".
An object made from a tree trunk and having multiple hooks or storage platforms.
(graph theory) graph tree with no cycles. (noun)
(graphical user interface) tree list (noun)
Any structure or construct having branches akin to (1).
(transitive) To chase (an animal or person) up a tree.
tree (kind of)
(computing theory) A recursive data structure in which each node has zero or more nodes as children.
frame of a saddle
(computing theory) recursive data structure (noun)
A widely-used data structure that emulates a tree structure with a set of linked nodes.