Data Structure Interview Questions (cont.)
Dequeue (also known as double-ended queue) can be defined as an ordered set of elements in which the insertion and deletion can be performed at both the ends, i.e. front and rear.
Two queues are needed. One queue is used to store the data elements, and another is used for storing priorities.
The Tree is a recursive data structure containing the set of one or more data nodes where one node is designated as the root of the tree while the remaining nodes are called as the children of the root. The nodes other than the root node are partitioned into the nonempty sets where each one of them is to be called sub-tree.
There are six types of tree given as follows.
Sưu tầm: Nguyễn Thị Bảo Trang
» Tin mới nhất:
» Các tin khác: