SKILL BENCHMARK

# Java Advanced Data Structures and Algorithm Literacy (Beginner Level)

• 20m
• 20 questions
The Java Advanced Data Structures and Algorithm Literacy (Beginner Level) benchmark measures your knowledge of the basic structure of a binary tree and utilizing tree traversal algorithms. You will be evaluated on your skills in implementing different types of graphs in code using common representations. The learners who score high on this benchmark demonstrate that they have the skills to work with binary trees and graph algorithms in Java.

## Topics covered

• define the adjacency list representation of a graph
• explain depth-first, in-order traversal in a binary tree
• explain depth-first, pre-order traversal in a binary tree
• implement pre-order traversal using recursion
• perform depth-first traversal on a graph
• perform operations on an adjacency matrix graph
• recognize directed and undirected graphs and their use cases
• recognize the similarities between graphs and trees
• represent a binary tree using the Java programming language
• represent weighted graphs using an adjacency matrix
• summarize breadth-first traversal in a binary tree
• summarize depth-first traversal in a binary tree
• understand how graph traversal techniques work
• use in-order traversal to traverse nodes via the left child, parent, and then right child
• use post-order traversal to traverse nodes via the left child, right child, and then parent
• visualize the levels of nodes visited in breadth-first traversal
• write code to represent graphs using an adjacency list
• write code to represent graphs using an adjacency matrix
• write code to represent graphs using an adjacency set