Amazon Backend Software Engineer Interview Questions and Answers

Array,Tree, Behaviour questions 2 hr duration easy-medium

Q1. Array Traversal using topological sort algorithm
Ans. 
Topological sort can be used to traverse an array of strings in a specific order.
• Topological sort is used to order elements based on their dependencies.

• In the context of array traversal, we can use topological sort to determine the order in which strings should be processed.

• For example, if strings represent tasks and their dependencies, we can use topological sort to ensure tasks are executed in the correct order.
Answered by AI
Add your answer
Q2. Right most node in almost complete bst
Ans. 
The rightmost node in an almost complete binary search tree is the last node in the last level of the tree.
• In an almost complete binary search tree, all levels are completely filled except possibly for the last level, which is filled from left to right.

• To find the rightmost node, start at the root and traverse the tree by always going to the right child until reaching the last level.

• The rightmost node will be the last
Answered by AI
Add your answer