WGU C949 Data Structures and Algorithms I Exam (New 2023/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A

WGU C949 Data Structures and Algorithms I Exam (New 2023/ 2024 Update) Questions and Verified Answers| 100% Correct| Grade A Q:UESTION A tree that maintains the simple property that a node's key is greater than or equal to the node's childrens' keys. Answer: max heap Q:UESTION A tree that maintains the simple property that a node's key is less than or equal to the node's childrens' keys. Answer: min heap Q:UESTION A data structure for representing connections among items, and consists of vertices connected by edges. Answer: graph Q:UESTION This represents an item in a graph. Answer: vertex Q:UESTION This represents a connection between two vertices in a graph. Answer: edge Q:UESTION A Last-in, First-out (LIFO) data container Answer: Stack Q:UESTION When something is retrieved from a stack, does it come from t bottom of the stack? Answer: Top Q:UESTION A First-in, First-out (FIFO) container Answer: Queue Q:UESTION When something is removed from a queue, does it come fro the tail? Answer: Head Q:UESTION When something is added to a queue, does it get added to the head or the tail? Answer: Tail Q:UESTION A queue-like container which is both First-in, First-out and Last-in, Last-out Answer: Doubly Ended Queue (deque) Q:UESTION Which type of function allows for items to be added or removed fr