What is a perfect number? A perfect number is a positive integer that is equal to the sum of its proper divisors excluding itself. These numbers are positive numbers that are less than the number itself. Let’s take an example…
Both binary tree and binary search tree are data structures that are used in computer programming. Binary Tree – It is a hierarchical data structure where each node has at most two children often referred to as the left and…
Big-O Complexity This is the algorithm’s worst-case complexity. Time complexity – It is defined as the number of times a particular instruction has been executed rather than the total time taken by the entire program execution. Space Complexity – It…
Recursion Definition – Recursion is a technique in programming language, where the function calls itself directly or indirectly is called Recursion. In this blog, I have added beginner-level examples of recursion. Breakdown of Recursive Algorithm Every recursive algorithm follows the…
In Data Structures binary trees is a very important topic. A binary tree is a hierarchical tree-like data structure which contains nodes and at most 2 children. Usually, we call these children left and right children or subtrees. Terms in…
Question – Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node. Logic to solve the minimum depth of the…
Join For Job Alerts
