Linear Array:
The simplest type of data structure is a linear array. Linear arrays are called one dimensional arrays because each element in such an array is referenced by one subscript.
Queue:
A queue also called a First-In First-Out (FIFO) system is a linear list in which deletions can take place only at one end of the list, the "front" of the list, and insertions can take place only at the other end of the list, the "rear" of the list.
Trees:
Data frequently contain a hierarchical relationship between various elements. The data structure which reflects this relationship is called a rooted true graph or simply a tree.
Complete Binary Tree:
A complete binary tree is a binary tree in which every level, except possibly the last, is completely field and all nodes are as for left as possible.
The simplest type of data structure is a linear array. Linear arrays are called one dimensional arrays because each element in such an array is referenced by one subscript.
Queue:
A queue also called a First-In First-Out (FIFO) system is a linear list in which deletions can take place only at one end of the list, the "front" of the list, and insertions can take place only at the other end of the list, the "rear" of the list.
Trees:
Data frequently contain a hierarchical relationship between various elements. The data structure which reflects this relationship is called a rooted true graph or simply a tree.
Complete Binary Tree:
A complete binary tree is a binary tree in which every level, except possibly the last, is completely field and all nodes are as for left as possible.
No comments:
Post a Comment