Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
A ternary tree is a type of tree data structure in which each node can have at most three children. In this article, we will learn how to implement a ternary tree in C++ using basic class structures and pointers. What is Ternary Tree? A ternary tree is a tree in which each node has up to three children, that is left, middle, and right. It is same as a binary tree, but with an extra child node for each node. Each node in a ternary tree stores a data value and pointers to its three child nodes. ... Read More
In this article, you will learn the setup to build and compile the C++ code in Visual Studio. Here you will become familiar with many of the tools and dialog boxes that you can use when you develop applications in C++. In this, we'll create a "Hello, World" style console application to help you learn more about working in this IDE. Prerequisites For this, you need a copy of Visual Studio 2017 version 15.3 or later, with the Desktop development with C++ workload installed. You can follow this guide to see the full installation procedure of Visual Studio [Link]. Create ... Read More
In this article, we will show you how to find the length of a string in C++. A string in C++ is a sequence of characters, such as letters, numbers, symbols, or anything enclosed in double quotes (e.g., "Hello"). To find the length of a string, we count all the characters, including spaces, but we don't count the null terminator('\0'). For example, let's look at the following string in C++. // Example 1 Input: "Learning C++ with tutorialspoint is fun!" To find the length, we count every character, including spaces. So, the total length is 40. Output: 40 ... Read More
In this article, we'll show how to write a C++ program to concatenate two strings. A string in C++ is a sequence of characters like letters, numbers, symbols, or anything enclosed in double quotes (e.g., "Hello"). Concatenating two strings means joining them together to form one combined string. For example, if we have two strings: str1 = "Welcome to" and str2 = "tutorialspoint!", after concatenation, the result will be: result = "Welcome to tutorialspoint!". Approaches to Concatenate Strings in C++ We can concatenate strings in C++ using different methods. Below are the approaches we will cover: ... Read More
Any linear equation in one variable has the form aX + b = cX + d. Here the value of X is to be found, when the values of a, b, c, d are given. Let's understand this with an example: //Example 1 If the input equation is 2X + 4 = -9X + 14, the solution is: => 2X + 9x = 14 - 4 => 11X = 10 => X = 10 / 11 = 1.1 //Example 2 If the input equation is -3X + 5 = 4X - 9 the solution is: => -3X + ... Read More
In this article we are going to discuss the set::find() function in C++ STL, their syntax, working and their return values. What is Set in C++ STL? Sets in C++ STL are the containers which must have unique elements in a general order. Sets must have unique elements because the value of the element identifies the element. Once added a value in a set container later can't be modified, although we can still remove or add the values to the set. Sets are used as binary search trees. What is set::find() The std::find() function is an inbuilt function in C++ ... Read More
Default Argument A default argument is a value provided during the function declaration that can be automatically assigned if no argument is provided when the function is called. If a value is passed at the time of the function call, this default value is overridden, and the argument becomes a parametrized Argument. Syntax The syntax below shows how we can define a default argument function: int fun(int x = 0){ // function body } Example of Default Argument The following C++ example shows the working of the default argument: #include using namespace std; //function defined with ... Read More
A deque is a double-ended queue linear data structure where elements can be added or removed from both the front and rear ends. Unlike a standard queue which is FIFO. A dequeue can function in both FIFO and LIFO modes. Application of Dequeue Deques are useful in a situation where you need to add or remove an element from both ends, such as in buffer implementation managing undo/redo functions or implementing certain algorithms. Deque Operations Deque supports the following operations: insert_at_beg(): inserts an item at the front of Dequeue. insert_at_end(): inserts ... Read More
Sorted Doubly Linked List A sorted doubly linked list is a type of doubly linked list in which elements are arranged in a specific order, typically ascending or descending based on the data values. Where, insertion operation makes sure that the new node is placed in its correct sorted position. A doubly linked list is a two-way linked list in which a node is connected with two pointers, i.e., next and previous pointers, which are references to the next node and previous node, respectively. Characteristics of Sorted Doubly Linked List The following are the characteristics of the doubly linked ... Read More
In C++, both virtual functions and runtime polymorphism are key features that enable dynamic behavior and code flexibility. Virtual Functions A virtual function is the member function that is declared in the base class using the keyword virtual and is overridden in the derived class. The virtual function enables runtime polymorphism means the function that will be executed is determined at runtime rather than at compile time. Characteristics of Virtual Function Following are the characteristics of the virtual function: Virtual function make sure the correct function is called for an object, regardless of the type ... Read More