data structure Java language

True or false T OR F : For an instance of Collection. you can obtain its Iterator using iterator0 Method T OR F : An ArrayList cannot grow automatically. T OR F: When you create an array using int] x - new int [10], x.length () is 10 . T OR F : If you want to store non duplicated objects in the collection then use ArrayList T OR F : In a sequential search of a sorted array, you must examine the entire array if an item is not present in the array. T OR F : in a tree, nodes are arranged in levels that indicate the nodes' hierarchy. T OR F : All leaves in a full binary tree are on the same level. T OR F : The postorder 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 OR F : The best-time complexity for insertion sort is nlogn T OR F : A graph can have only one path between the same two vertices. TOR F: The UNDO function in MS-Excel use the stack concept TOR F : In the queue, new element can be added from the front only T OR F : Last element added to a queue is the first one removed T OR F : A linked list dynamically grows as needed and essentially has no capacity limitations