Flashcards
Tree Structure
Cards in this deck (10)
- 1TreeA data structure similar to a graph, with no loops.
Is an abstract data structure that has nodes and edges. - 2NodeAn object in a tree (vertex).
Trees can have a root node, with all the other nodes branching away from the root. - 3EdgeA join of relationships between nodes (arc)
- 4RootThe starting node in a rooted tree structure which all other nodes branch off.
- 5ParentA type of node in a tree, where there are further nodes below it.
- 6ChildA node in a tree that has a node above it in the hierarchy.
- 7LeafA node that does not have any other nodes beneath it.
- 8UsesCan be used to store data that has an inherent hierarchical structure
E.g. An operating system may use a tree for directories, files, and folders in its file management system. - 9UsesThey are used because:
They are Dynamic, easy to add and delete nodes.
Are easy to search and sort using standard traversal algorithms. - 10Binary TreeeA tree where each node can only have up to two child nodes attached to it.
A binary tree is a rooted tree in which each node has a maximum of two children. This make the tree balanced.
Information
- Description
- Flashcards on Tree Structure, created by Yousaf Orangzaib on 30/04/2018.
- Created by
- Yousaf Orangzaib
- Views
- 0
- Rating