Trees and GraphsGraph traversal, shortest paths, heaps, and more
Tree traversal algorithms
Common algorithms on how to traverse a tree visiting each node only once.
Determine if a tree is a subtree of a larger binary tree
Use tree traversal algorithms to solve this tree algorithm question.
Binary Search Tree LCA
For this challenge you will attempt to find the lowest common ancestor of a binary search tree.
137 solutions
Solution
Max Heap Checker
For this challenge you will determine whether or not a heap is a max heap.
73 solutions
Solution
Symmetric Tree
For this challenge you will traverse a binary tree and determine if it is symmetric.
136 solutions
Solution
Binary Tree LCA
For this challenge you will attempt to find the lowest common ancestor of a binary tree.
70 solutions
Solution
Tree Constructor
For this challenge you will determine if an array of integer pairs can form a binary tree properly.
63 solutions
Solution
Find minimum spanning tree using Prim's algorithm
A popular algorithm for finding a minimum spanning tree which connects all vertices of a graph.
Shortest Path
For this challenge you will have to determine the shortest path from one node to an end node.
916 solutions
Solution
Weighted Path
For this challenge you will have to determine the shortest weighted path from one node to an end node.
309 solutions
Solution
Hamiltonian Path
For this challenge you will determine whether a given set of vertices form a Hamiltonian path on the graph.
124 solutions
Solution
Vertex Covering
For this challenge you will determine whether a given set of vertices can cover all the edges in the graph.
127 solutions
Solution
Farthest Nodes
For this challenge you will determine what nodes are farthest apart.
132 solutions
Solution
Bipartite Matching
For this challenge you will be finding the maximum cardinality matching of a bipartite graph.
16 solutions
Solution
Seating Students
For this challenge you will determine how many different ways students can sit next to each other.
48 solutions
Solution
City Traffic
For this challenge you will be finding the maximum traffic that will enter a node.
17 solutions
Solution