Data Structures Quiz

In a stack, which of the following is the correct behavior?

• First-In, First-Out (FIFO)

• First-In, Last-Out (FILO)

• Last-In, First-Out (LIFO)

• Last-In, Last-Out (LILO)

What is the main operation used to remove an element from the front of a queue?

• Push

• Pop

• Enqueue

• Dequeue

In a binary tree, what is a node that has no children called?

• Root node

• Parent node

• Leaf node

• Sibling node

Which of the following is an application of stacks?

• Serving print jobs in a printer queue

• Finding palindromes

• Handling CPU scheduling

• Disk management

In a queue, the first element added is the first one to be removed. This ordering is known as the __________ principle.

The root node in a tree has no __________.

The method used to add an element to a stack in Python is __________.

Identify the tree traversal method where nodes are visited in the order Left, Root, Right.

What structure is used to evaluate a postfix expression by repeatedly popping and applying operators to the operands?

Identify the type of node in a tree that has the same parent as another node.