Data Structure Questions and Answers-Binary Trees using Linked Lists

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<

Data Structure Questions and Answers-Binary Trees using Linked Lists

Question 1
Advantages of linked list representation of binary trees over arrays?
A
dynamic size
B
ease of insertion/deletion
C
ease in randomly accessing a node
D
both dynamic size and ease in insertion/deletion
English literature Questions answers
Question 1 Explanation: 
It has both dynamic size and ease in insertion and deletion as advantages.

Question 2
Disadvantages of linked list representation of binary trees over arrays?
A
Randomly accessing is not possible
B
Extra memory for a pointer is needed with every element in the list
C
Difficulty in deletion
D
Random access is not possible and extra memory with every element
Public administration Questions answers
Question 2 Explanation: 
Random access is not possible with linked lists.

Question 3
How to travel a tree in linkedlist representation?
A
using post order traversing
B
using pre order traversing
C
using post order traversing
D
all of the mentioned
Economics Questions answers
Question 3 Explanation: 
Also level order traversing is possible.

Question 4
Level order traversal of a tree is formed with the help of
A
breadth first search
B
depth first search
C
dijkstra's algorithm
D
prims algorithm
Public administration Questions answers
Question 4 Explanation: 
Level order is similar to bfs.

Question 5
Why we prefer threaded binary trees?
A
storage required by stack and queue is more
B
pointers in most of nodes of a binary tree are NULL
C
difficult to find a successor node
D
all of the mentioned
Home science Questions answers
Question 5 Explanation: 
All the given options are properties for a threaded tree.

There are 5 questions to complete.

 

 Help authour, Buy PDF Ebook   >>>Click Here<<<