More Problems

• Implement a function to check if a directed graph is acyclic.
• Write a program to find all articulation points in an undirected graph.
• Implement a function to print all bridges in a graph.
• Write a program to find the shortest path from the root to any leaf node in a binary tree.
• Implement a function to calculate the total number of leaf nodes in a tree.
• Write a program to print the adjacency list of a directed graph.
• Implement a function to check if a graph is planar using DFS.
• Write a program to print the degree of each node in a tree.