Data Structure and Algorithms in C, C++, Java, Python Interview Questions - 1

Question: 1

What is breadth first search?

It is a method of graph traversal in which one node is selected as the starting point, it is visited, the all nodes adjacent to that node are visited, then nodes adjacent to those nodes are visited, and so until the entire graph has been traversed.

Question: 2

What is a hashing?

It is an address calculation technique. Also known as hash table method, direct addressing technique, key-to-address transformation method, randomizing technique, and scatter storage technique.

Question: 3

What is merging?

It is the process of combining records in two or more sorted structures to form a single structure of same type.

Question: 4

What is a threaded tree?

It is a tree that uses its unused pointers in a node to point to its predecessor and/or successor in an in order traversal.

Question: 5

What is a binary tree?

It is a tree where each node can have maximum out-degree of 2.