Breadth First search is used in____________.

Related Questions

• The data structure required for Breadth First Traversal on a graph is?
• ____________ data structure is used to implement Depth First search.
• Which of the following is useful in traversing a given graph by Breath first search?
• A self – balancing binary search tree can be used to implement
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
• In a binary search tree, which of the following traversals would print the numbers in the ascending order?
• Which of the following is false about a binary search tree?
• What is the speciality about the inorder traversal of a binary search tree?
• What are the worst case and average case complexities of a binary search tree?
• What are the conditions for an optimal binary search tree and what is its advantage?