Articles for author: Harshit Kumar

Harshit Kumar

Data Structures and Algorithms

Recursion Tree Method

The Recursion Tree Method resolves recurrence relations by converting them into recursive trees, where each node signifies the cost at different recursion levels. This visual representation simplifies understanding. Recursion, vital in computer science and mathematics, enables functions to self-reference. Recursion trees visually depict the iterative execution of recursive functions, aiding comprehension in problem-solving. Types of ...

Harshit Kumar

Data Structures and Algorithms

Biconnected Components

A bioconnected component of a graph is a connected subgraph that cannot be broken into disconnected pieces by deleting any single node (and its incident links). An articulation point is a node of a graph whose removal would cause an increase in the number of connected components. Scope **Before diving into Biconnected components let’s first ...