This operation adds an item to the top of the stacks.

• Peek

• Pop

• Pull

• Push

If a tree consist of nodes where each has two(2) child nodes at most, what is it called?

• Binary Tree

• Dual Tree

• Double Tree

• Twin Tree

Whta is the process of visiting all nodes in a specific order?

• Abstraction

• Inheritance

• Polymorphism

• Traversal

This operation adds an item to the queue.

• Dequeue

• Enqueue

• Pop

• Push

This is the tree's highest level.

• Degree

• Depth

• Edge

• Subtree

Complete the Java code below.

Queue queue = new LinkedList();

________.offer("Ma'am BK");

• add

• Linkedlist

• Queue

• queue

Which of the ff. is NOT a step in converting an infix into postfix expression?

• If the token is an operand, append it to the postfix expression.

• If the token is an operator, push it to the stack if empty.

• If left parenthesis is encountered, pop all the elements until a right parenthesis is encountered.

• Classify the token as operand or operator.

How many dictionaries represent child nodes in the given file path? C:\Users\bpena\Documents\Midterm

• 1

• 2

• 4

• 5

Which causes an error in the ff. statements?

Stack stack = new Stack();

stack.push();

• Stack

• stack

• new

• push();

Which of the ff. is NOT an example of a palindrome?

• data

• eve

• madam

• refer