1 votes 1 votes The data structures most suitable to do an inorder and level order traversals of a binary tree respectively are Stack and Queue Queue and Stack Stack and Stack Queue and Queue DS go2025-ds-1 stack queue + – gatecse asked Aug 9, 2020 • edited Aug 9, 2020 by soujanyareddy13 gatecse 278 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Inorder traversal (Left, Root, Right) : Stack Level order traversal (or) Breadth first traversal: Queue So, the correct answer is $(A).$ Lakshman Bhaiya answered Aug 10, 2020 • selected Aug 8, 2021 by Arjun Lakshman Bhaiya comment Share Follow See all 0 reply Please log in or register to add a comment.