📘 Graph and Tree Algorithms Tutorial

This Jupyter Notebook is a complete tutorial on fundamental graph and tree algorithms using Python. It's designed for learners aiming to build strong foundations in graph theory with practical code examples and visual understanding.

📚 Topics Covered

1. Degree of Vertices – Calculate degree of each node.
2. Graph Representation Conversion
   • Adjacency Matrix ↔ Adjacency List ↔ Edge List
3. Adjacency Check – Check if two vertices are adjacent.
4. Completeness Check – Is the graph complete?
5. Connectivity Check – Is the graph connected?
6. Walk / Trail / Path Checker – Validate sequences as walk, trail, or path.
7. Tree Detection – Check if a graph is a tree.
8. Spanning Tree Extraction – Generate a spanning tree.
9. Leaf Node Count – Count number of leaf nodes in a tree.
10. Binary Tree Check – Determine if a tree is binary.
11. Tree Height – Compute height of a tree.
12. Node Depth – Find depth of a specific node.

---