In this program, you'll learn two techniques to swap two numbers in Kotlin. The first one uses a temporary variable for swapping, while the second one doesn't use any temporary variables.

In this program, user is asked to enter two numbers (floating point numbers). Then, the product of those two numbers is stored in a variable and displayed on the screen.

This example contains two different techniques to swap numbers in C programming. The first program uses temporary variable to swap numbers, whereas the second program doesn't use temporary variables.

In this program, you'll learn two techniques to swap two numbers in Java. The first one uses a temporary variable for swapping, while the second one doesn't use any temporary variables.

In this example, you will learn to calculate the GCD (Greatest Common Divisor) between two numbers. This page contains different ways to find hcf or gcd in C programming with output and explanation...

Binary Search is a searching algorithm for finding an element's position in a sorted array. In this tutorial, you will understand the working of binary search with working code in C, C++, Java, and Python.

In this article, you'll learn about the different numbers used in Python, how to convert from one data type to the other, and the mathematical operations supported in Python.

A full Binary tree is a special type of binary tree in which every parent node/internal node has either two or no children. Also, you will find working examples to check the full binary tree in C, C++, Java, and Python.

A binary tree is a tree data structure in which each parent node can have at most two children. Also, you will find working examples of binary tree in C, C++, Java and Python.

A complete binary tree is a binary tree in which all the levels are completely filled except possibly the lowest one, which is filled from the left. Also, you will find working examples of a complete binary tree in C, C++, Java and Python.

In this tutorial, you will learn about a balanced binary tree and its different types. Also, you will find working examples of a balanced binary tree in C, C++, Java and Python.

A binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers. Also, you will find working examples of Binary Search Tree in C, C++, Java, and Python.

In this tutorial, you will learn about the perfect binary tree. Also, you will find working examples for checking a perfect binary tree in C, C++, Java and Python.