# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Data Structure Questions and Answers-Binary Trees using Linked Lists

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Advantages of linked list representation of binary trees over arrays?

dynamic size | |

ease of insertion/deletion | |

ease in randomly accessing a node | |

both dynamic size and ease in insertion/deletion |

Question 1 Explanation:

It has both dynamic size and ease in insertion and deletion as advantages.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Disadvantages of linked list representation of binary trees over arrays?

Randomly accessing is not possible | |

Extra memory for a pointer is needed with every element in the list | |

Difficulty in deletion | |

Random access is not possible and extra memory with every element |

Question 2 Explanation:

Random access is not possible with linked lists.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

How to travel a tree in linkedlist representation?

using post order traversing | |

using pre order traversing | |

using post order traversing | |

all of the mentioned |

Question 3 Explanation:

Also level order traversing is possible.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Level order traversal of a tree is formed with the help of

breadth first search | |

depth first search | |

dijkstra's algorithm | |

prims algorithm |

Question 4 Explanation:

Level order is similar to bfs.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Why we prefer threaded binary trees?

storage required by stack and queue is more | |

pointers in most of nodes of a binary tree are NULL | |

difficult to find a successor node | |

all of the mentioned |

Question 5 Explanation:

All the given options are properties for a threaded tree.

There are 5 questions to complete.