In a binary search tree (BST), the second largest element must be returned. In a binary tree, the second element is the largest element. According to the given BST, 13 is the second largest element. Now we are using the C++ approach to solve this problem. We can traverse the tree inorder, and by observation, we can observe that the second largest element in the given BST is 13. The inorder of the tree will be 1 3 4 6 7 8 10 13 14, and we can observe that the elements are in the sorted array. So we ... Read More
In this article, we are given a BST (binary search tree), and we need to find the shortest distance between 2 given nodes in the BST. Let's have a tree and below are the following scenarios. Let’s assume some simple input and output scenarios Now we have to find the distances between nodes 4 and 13. int key1=13, key2=4; res = solve(root, min(key1, key2), max(key1, key2)); output = 6 The shortest distance is 6, which is through 4->6->3->8->10->14->13(the arrows show a path definition and not anything else). Let’s find another distance from two different nodes in the above ... Read More
Suppose we have a binary tree and we want to replace the depth of each node with its value. The depth of the node starts from 0 at the root node and increases by 1 for each level we go; for example, we have a binary tree like this; Here we replace, Node Value Depth 1 0 2 1 3 1 4 2 5 2 6 2 7 2 8 3 9 3 We do a simple ... Read More
This tutorial will teach us to convert negative numbers to positive ones. Sometimes, programmers need to perform some operation with the unsigned value of the number, and in such a case, they need to convert the negative numbers to positive numbers. We will go through the various methods to convert a negative number to a positive number in this tutorial. Using the Math.abs() Method Multiplying the negative number with -1 Using the Bitwise Not Operator Using the Math.abs() Method The Math.abs() method is the JavaScript math library method. The Math.abs() method takes a value as a parameter and ... Read More
We are given a binary tree, and we need to replace all the elements with the sum of its inorder predecessor and successor. Inorder is a traversed path in a graph that reads in the order of left node – root node – right node. The method adds the elements in left and right nodes of the parent node and replaces the value with the obtained sum. Suppose we have a tree with the following formation and characters − We can find and store the inorder of the tree in an array. After that, we can again do an ... Read More
This tutorial will teach us to convert the decimal number to a binary number string. The binary number is the string of only 0 and 1. The computer doesn’t understand the high-level programming language, so we need to instruct the computer in a low-level language, represented as the binary string. Also, binary string is used in digital electronics. Here, we have three methods to convert the decimal number to a binary string. Using the toString() Method Using the right shift Operation Using the modulo Operator Using the toString() Method The toString() method is JavaScript built-in string method that ... Read More
Given two integers N and k, we need to count the number of derangements where k points are fixed at their position. Given constraints on k are between 0 and n as the number of fixed points when there are n points cannot be more than n. int N=4, k=2; res = solve(N, k); Note that at least conditions don’t hold on k. There has to be precisely and strictly k points on their original index. This is a mathematical problem. Not explaining the proof and explanation of mathematics, we as computer science majors can use the results ... Read More
Suppose we are given a binary tree and three nodes in that binary. We have to disconnect one node entirely from the tree. Disconnecting that node leaves us with three different trees. Each of the three given nodes lies in one of them, or each of the given three nodes must not exist in the same tree. Disconnecting a node means that we will remove all the edges from this node to all other nodes. Example For example, let's say we have a tree with three nodes 18, 15, and 17 as shown below − If the task ... Read More
In this tutorial, we will learn to convert the Boolean to string in JavaScript. The problem is straightforward: sometimes programmers need to use the boolean true and false values as a string. So, there is a requirement to convert the Boolean to string. Here, we have various methods to convert the Boolean to a string variable. Using the toString() Method Using + and $ (template literal) Operator Using the ternary Operator Using the toString() method The toString() method is the JavaScript string library method, which is useful for converting the variables to the string data type. We can ... Read More
This tutorial will teach us to show a euro or HTML entity in JavaScript alert Window. There are three pop-up windows in JavaScript. Alert box, Confirm box, and Prompt box. The alert box is useful to show some information to the user, such as a welcome message or user’s info. It contains the ok button, and when the user clicks on that, it closes. The confirm box is used to show the confirmation message. In many applications, you have seen that when you try to delete something, it shows the confirmation message. When you click on the ok, it returns ... Read More
Data Structure
Networking
RDBMS
Operating System
Java
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP