WGU C949 Data Structures and Algorithms|OA|OBJECTIVE
ASSESSMENT|EXPLORE NEW 102 ACTUAL QUESTIONS AND
ANSWERS|100% ACCURATE|NEW ED|2025
Correct 102
Incorrect
WGU C949 Data Structures and Algorithms
Term
Give this one a go later!
Don't know?
,Term
A doubly linked list where the values are inserted and sorted in order
Give this one a go later!
Binary Tree Linked List
Stack Sorted List
Don't know?
3 of 102
Term
An example of why pre-order traversals are useful
Give this one a go later!
To create an identical copy of a
To sort the elements of the tree
tree
To count the number of leaves in the
To find the height of the tree
tree
Don't know?
4 of 102
Term
, O(log n) Uniformity
O(nm) min heap
Don't know?
5 of 102
Term
The node is visited before it's children
Give this one a go later!
Post-order Level-order
Pre-order In-order
Don't know?
6 of 102
Term
A data structure that stores ordered list of items in nodes, where each
node stores data and has a pointer to the next node.
Give this one a go later!
, Don't know?
7 of 102
Term
Which statement is static?
readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100];
Give this one a go later!
Binary Search Tree binary tree
1 readonly Contact contacts =
(201%50) new Contacts[100];
Don't know?
8 of 102
Term
A list that builds on the singly linked list by adding reverse iteration.
Give this one a go later!
Doubly Linked List Sorted List
ASSESSMENT|EXPLORE NEW 102 ACTUAL QUESTIONS AND
ANSWERS|100% ACCURATE|NEW ED|2025
Correct 102
Incorrect
WGU C949 Data Structures and Algorithms
Term
Give this one a go later!
Don't know?
,Term
A doubly linked list where the values are inserted and sorted in order
Give this one a go later!
Binary Tree Linked List
Stack Sorted List
Don't know?
3 of 102
Term
An example of why pre-order traversals are useful
Give this one a go later!
To create an identical copy of a
To sort the elements of the tree
tree
To count the number of leaves in the
To find the height of the tree
tree
Don't know?
4 of 102
Term
, O(log n) Uniformity
O(nm) min heap
Don't know?
5 of 102
Term
The node is visited before it's children
Give this one a go later!
Post-order Level-order
Pre-order In-order
Don't know?
6 of 102
Term
A data structure that stores ordered list of items in nodes, where each
node stores data and has a pointer to the next node.
Give this one a go later!
, Don't know?
7 of 102
Term
Which statement is static?
readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100];
Give this one a go later!
Binary Search Tree binary tree
1 readonly Contact contacts =
(201%50) new Contacts[100];
Don't know?
8 of 102
Term
A list that builds on the singly linked list by adding reverse iteration.
Give this one a go later!
Doubly Linked List Sorted List
