DATA STRUCTURE INTERVIEW QUESTION & ANSWERS
6. |
Define sibling? |
|
The nodes with common parent are called siblings or brothers. |
|
Posted by Vishnupriya. (Nov 29, 2013) |
|
The nodes which are belonging to same parent. |
7. |
What is a linear data structure? |
|
The linear data structure is a type, in this type of data Structure is in a sequential manner way. There is no hierarchy followed for data arrangement. The typical examples of linear data structures are
Arrays and
Linked lists.
|
8. |
What are the types of binary trees? |
|
There are three types of binary trees : - Left skewed binary tree
-
Right skewed binary tree and
-
Complete binary tree
|
9. |
What is a binary tree? |
|
A binary tree is a data structure in which every node has at most two child nodes (i.e., a node can have zero, one or two child nodes}. Child nodes are referred to as left and right nodes. Each node can have data in it. |
10. |
What is a binary search tree? |
|
A binary search tree is a binary tree in which elements are
stored in a sorted order. The left subtree of a node will have values less than the value in the node. Similarly, the right subtree of a node will have values greater than the value in the node. |