The ar Falve

$(0\mathrm{.}5$ Mark each$)$

For each of the following statements, circle either $T$ if the statement is true or $F$ if

the statement is False.

T F ln a tree, nodes are arranged in levels that indicate the nodes' hierarchy.

T F All leaves in a full binary tree are on the same level.

T F The postonder traversal is to visit the left subtree of the current node first,

then the right subtree of the current node, and finally the current node

itself.

T F The pop operation is implemented by retuming a reference to the element

currently stored at the top of the stack and adjusting the top reference to

the new top of the stack.

T F A graph can have only one path between the same two vertices.

T F For an instance of Collection, you can obtain its iterator using iterator$()$

method.

T F An AmayList cannot grow automatically.

T F When you create an array using int$]x=$ new int $[10],x.$length $0$ is $10.$

T F If you want to store non$-$duplicated objects in the eollection then use

Arraylist

T F In a sequential search of a sorted array, you must examine the entire array

if an item is not present in the array.

Write a program to create an ArrayList of names. The program prompts the

user to enter $10$ names, add the names to the ArrayList and display only those

names that starts with letter $\text{'}A\text{'}$ or $\text{'}S\text{'}$

$(4$ Marks$)$