Posts by Tanisha Saxena

Author Biographical Info: Not available

Searching in a sorted and rotated array using Java

By Tanisha Saxena

In this tutorial, we will see how to search an element in a sorted and rotated array using Java. Here, our challenge is to search the element in such an array in o(log n) time comp.... Read More

How to do Bucket sort in Java?

By Tanisha Saxena

In this tutorial, we will learn to perform bucket sort in java to sort any given array. Bucket sort can sort an array in linear time but it only works for special set of inputs. Th.... Read More

Implementing Shell sort in Java

By Tanisha Saxena

In this tutorial, we will implement shell sort in Java programming language. Shell sort is a sorting algorithm which does in place comparison. It is a generalization of insertion s.... Read More

How to find level of a node in Binary Tree in Java

By Tanisha Saxena

We will learn how to find out the level of a given node in binary tree in Java. We will search for the key in binary tree. The level of the root is 1. If we do not find the key in .... Read More

How to find lowest common ancestor in binary tree in Java

By Tanisha Saxena

In this tutorial, we will see how to find the lowest common ancestor(LCA) in a binary tree in Java. It is nothing but the lowest common parent of any two given nodes. We will be so.... Read More

Implementing Heap Sort in Java

By Tanisha Saxena

In this tutorial, we will learn to implement heap sort in java. A heap is a tree with some special properties, so the value of node should be greater than or equal to(less than or .... Read More

Java program to calculate surface area and volume of a sphere

By Tanisha Saxena

In this tutorial, we will see how to write a java program to find the volume and surface area of any given sphere. Before we begin, let us first see the definition and formulas use.... Read More

How to perform Depth First Search in Java?

By Tanisha Saxena

In this tutorial, we will learn how to perform Depth First Search or DFS on a graph in java. There are two ways to traverse a graph: Breadth first search Depth first search DFS .... Read More