Hello, my name is Richa. Welcome to my Dev Blog

Just here to share whatever I've learned in Data Structures and Algorithms

Blog Post illustration

Time Complexity of Algorithms

Published

The time complexity of an algorithm is the time taken by an algorithm to run. The significance Sometimes, when we try to solve a problem, we might think of more than one way to solve it. Now some of these approaches might take less time to come to th...

algonoob avatar
Richa Kiran
Blog Post illustration

Binary Search

Published

Binary Searching algorithm is used to search for an element in a sorted array. It involves dividing an array into halves until the element is finally found. I've already given a brief introduction of this algorithm in one of my previous posts. You ca...

algonoob avatar
Richa Kiran
Blog Post illustration

Linear Search

Published

In this article I'm gonna be talking about the mechanism of Linear Search Algorithm and how you can implement it in C. I've already given you a brief introduction of this algorithm in my previous article. You can check it out here. So, summing it all...

algonoob avatar
Richa Kiran
Blog Post illustration

Search Algorithms

Published

Searching algorithms are designed to locate the position of an element (if present) in a data structure. To search for an element in a linear data structure like an array, we can use many different types of searching algorithms. Here we're gonna tal...

algonoob avatar
Richa Kiran
Blog Post illustration

Applications of Binary Trees

Published

So far we've discussed about how we can perform certain operations on a Binary Search Tree. It is no fun to learn about new stuff when you don't know where exactly you can use it. So, In this article I'm gonna be talking about the applications of Bin...

algonoob avatar
Richa Kiran
Blog Post illustration

In this article I'm gonna talk about how we can find the k'th maximum element in a given Binary Search Tree. Previously we talked about the methods of finding the k'th minimum element in a BST. If you haven't read that yet, please check it out here b...

algonoob avatar
Richa Kiran
Blog Post illustration

So far we've discussed about insertion, deletion and searching operations in a Binary Search Tree. If you haven't read them yet, you can check them out here. In this post I'm gonna talk about how you can find the K'th - Minimum element in a Binary Se...

algonoob avatar
Richa Kiran
Blog Post illustration

In this post I'm gonna be talking about deletion of a node in Binary Search Tree. There can be three scenarios for deletion of a node in a Binary Search Tree. Let's first discuss the three scenarios. The three situations of deletion 1. Node to be de...

algonoob avatar
Richa Kiran
Blog Post illustration

Searching in Binary Search Tree

Published

In this post, I'm gonna be talking about how we can search for an element in a Binary Search Tree. It is very easy to search for an element in a Binary Search Tree, easier than even in an array. All you have to do is compare the element's value with ...

algonoob avatar
Richa Kiran
Blog Post illustration

Binary Tree Traversal Methods

Published

In this article I'm gonna talk about the ways of traversal we can perform on Binary Trees. A node of a binary tree primarily consists of three components - it's own data (D) It's left child (L) It's right child (R) Consider a node to be the most b...

algonoob avatar
Richa Kiran
1 2 3 4 5