0 votes 0 votes Application of data structure queue is : Levelwise printing of tree Implementation of priority queues Function call implementation Depth first search in a graph Others ugcnetcse-june2006-paper2 + – go_editor asked Mar 27, 2020 edited May 20, 2021 by soujanyareddy13 go_editor 806 views answer comment Share Follow See 1 comment See all 1 1 comment reply HeartBleed commented Nov 20, 2018 reply Follow Share Queue is used for Level order traversing of a tree. Stack is used for implementing: Function call implementation and Depth first search in a graph. For priority queues we generally use heap. 3 votes 3 votes Please log in or register to add a comment.
0 votes 0 votes Queue is used for Level order traversing of a tree. Stack is used for implementing: Function call implementation and Depth first search in a graph. For priority queues we generally use heap. HeartBleed answered Jan 5, 2020 HeartBleed comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Queue Data structure is used in Level order traversal of the tree BFS, rest all are the application of Stack data structure so the correct answer is B Viplove04 answered Jan 5, 2020 Viplove04 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans: A) Seem to be most suitable For Function call implementation & Depth first search in a graph “Stack” is suitable Priority Queues can be implemented mostly using common data structures like arrays, linked-lists, heaps and binary trees nocturnal123 answered Aug 21, 2020 nocturnal123 comment Share Follow See all 0 reply Please log in or register to add a comment.