**Data structure interview question:**Of the following tree structure, which is, efficient considering space and time complexities?

(a) Incomplete Binary Tree

(b) Complete Binary Tree

(c) Full Binary Tree

(d) Complete Binary Tree.

**Answer**:

By the method of elimination:

Full binary tree loses its nature when operations of insertions and deletions are done. For incomplete binary trees, extra storage is required and overhead of NULL node checking takes place. So complete binary tree is the better one since the property of complete binary tree is maintained even after operations like additions and deletions are done on it.

**Data structure interview question**:

**What is a spanning Tree?**

**Answer**:A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

**Data structure interview question**:Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

**Answer**

**:**No. Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

**Data structure interview question**: Which is the simplest file structure?

(a) Sequential

(b) Indexed

(c) Random

**Answer**: Sequential

**Data structure interview question**:Whether Linked List is linear or Non-linear data structure?

**Answer**:According to Access strategies Linked list is a linear one.

According to Storage Linked List is a Non-linear one.

## No comments:

## Post a Comment