Ravi Ranjan

Ravi Ranjan

About

Hello readers, I am a technical content engineer having expertise in front-end web development and C++.

117 Articles Published

Articles by Ravi Ranjan

Page 4 of 12

Check if a given array can represent Preorder Traversal of Binary Search Tree in C++

Ravi Ranjan
Ravi Ranjan
Updated on 19-Aug-2025 660 Views

In this article, we have an array of preorder traversal of a binary search tree. Our task is to check if the given array can represent the preorder traversal of the binary search tree. In preorder traversal of tree, the root node is visited first, then the left subtree, and finally the right subtree. What is Binary Search Tree? A binary search tree is a tree data structure and a special type of binary tree that follows the conditions given below: The left child node's value is always less than the parent node. ...

Read More

Balance a Binary Search Tree in c++

Ravi Ranjan
Ravi Ranjan
Updated on 19-Aug-2025 3K+ Views

In this article, we have a binary search tree and our task is to balance the given binary search tree. A binary search tree is a tree data structure and a special type of binary tree that follows the conditions given below: The left child node's value is always less than the parent node. The right child node has a greater value than the parent node. All the nodes individually form a binary search tree. The inorder traversal of nodes in BST are ...

Read More

Binary Tree to Binary Search Tree Conversion in C++

Ravi Ranjan
Ravi Ranjan
Updated on 19-Aug-2025 1K+ Views

To convert a binary tree to a binary search tree, use the inorder tree traversal of the tree. In inorder traversal, we first traverse the left subtree, then the root node, and then the right subtree. The nodes in inorder traversal of a binary search tree are in ascending order, so we find the inorder traversal of binary tree, sort it in ascending order, and place the sorted nodes in binary tree using inorder traversal to get the binary search tree. Understanding Binary Tree and Binary Search Tree A binary tree is a special type of tree in which ...

Read More

Binary search in sorted vector of pairs in C++

Ravi Ranjan
Ravi Ranjan
Updated on 18-Aug-2025 761 Views

In this article, we have a sorted vector of pairs. Our task is to search for a target key using binary search in the given vector of pairs. Binary Search Algorithm The binary search algorithm works on the divide-and-conquer principle as it keeps dividing the array in half before searching. To search for an element in an array using binary search, it should be sorted. In the sorted array, we find the middle element and compare it with the element that has to be searched, and based on the comparison, we either search in the left or right sub-array or ...

Read More

Binary Search on Singly Linked List in C++

Ravi Ranjan
Ravi Ranjan
Updated on 08-Aug-2025 2K+ Views

In this article, we are given a sorted singly linked list, and our task is to search for a given node using a binary search algorithm. The binary search algorithm works on the divide-and-conquer principle as it keeps dividing the list in half before searching. To search for an element in the linked list using binary search, it should be sorted. In the sorted linked list, we find the middle node using two pointers (slow and fast) and compare it with the target node, and based on the comparison, we either search in the left or right sub-list or return ...

Read More

Binary Search a String in C++

Ravi Ranjan
Ravi Ranjan
Updated on 06-Aug-2025 5K+ Views

The binary search algorithm works on the divide-and-conquer principle as it keeps dividing the array in half before searching. To search for an element in an array using binary search, it should be sorted. In the sorted array, we find the middle element and compare it with the element that has to be searched, and based on the comparison, we either search in the left or right sub-array or return the middle element. In this article, we are given a sorted array of strings, and our task is to search for the given string using a binary search algorithm. ...

Read More

C++ code to find minimum arithmetic mean deviation

Ravi Ranjan
Ravi Ranjan
Updated on 31-Jul-2025 375 Views

The arithmetic mean deviation or mean absolute deviation is the summation of the absolute differences of each element and the mean of the dataset, then dividing it by the total number of data elements. To calculate the minimum arithmetic mean deviation, we used the median of the dataset in place of the mean. The formula to calculate the minimum arithmetic mean deviation is given as: $$ \text{MMD} = \frac{1}{n} \sum_{i=1}^{n} |x_i - M| = \frac{|x_1 - M| + |x_2 - M| + \cdots + |x_n - M|}{n} $$ Here are some example scenarios to calculate the ...

Read More

Area of the Largest Triangle inscribed in a Hexagon in C++

Ravi Ranjan
Ravi Ranjan
Updated on 28-Jul-2025 516 Views

In this problem, our task is to find the area of the largest triangle that can be inscribed in a regular hexagon. Each side of the hexagon and triangle is of length a and b, respectively. Area of the Largest Triangle Inscribed in a Hexagon You can calculate the area of the largest triangle inscribed in a regular hexagon using the following formula: $$ Area\ of\ triangle\ inside\ hexagon\ = \frac{3\sqrt{3}}{4} \cdot a^2 $$ Derivation The first step is to establish a relation between a and b, as the value of a(side of the hexagon) is ...

Read More

Area of a square from diagonal length in C++

Ravi Ranjan
Ravi Ranjan
Updated on 28-Jul-2025 410 Views

A diagonal of a polygon is the line joining two vertices that are not adjacent to each other. The formula for calculating the area of a square with diagonal length is a2 = d2 / 2, where a and d are the side and diagonal length of the square, respectively. The visual representation of the derivation of the formula is given below: Here are some example scenarios to calculate the area of a square from the diagonal length using the above formula: Scenario 1 Input: d = 10 Output: 50 Explanation: Using the formula: area = ...

Read More

Area of a triangle inside a parallelogram in C++

Ravi Ranjan
Ravi Ranjan
Updated on 28-Jul-2025 649 Views

The area of a triangle is given as (base * height) / 2, and the area of a parallelogram is base * height. For calculating the area of the triangle inside the parallelogram, we divide the area of the parallelogram by 2, i.e., (base * height) / 2, where the base and the height of the parallelogram are given. Here are some example scenarios to calculate the area of a triangle inside a parallelogram using the above formula: Scenario 1 Input: base = 10, height = 8 Output: 40 Explanation: Using the formula: Area ...

Read More
Showing 31–40 of 117 articles
« Prev 1 2 3 4 5 6 12 Next »
Advertisements