In a tree data structure, the data items are usually called nodes with the links known as branches. A node may have any number of descendants but itself may only be the descendant of one other node. This data structure is often seen in a directory of files, where directory nodes are linked to sub-directories. It is usual in computing to draw a tree diagram
- Jump:
- a -
- b -
- c -
- d -
- e -
- f -
- g -
- h -
- i -
- j -
- k -
- l -
- m -
- n -
- o -
- p -
- q -
- r -
- s -
- t -
- u -
- v -
- w -
- x -
- y -
- z -
- symbols