Introduction A. J. Perlis and C. Thornton proposed a new version of a binary tree called “Threaded Binary Tree” that uses NULL pointers to improve its traversal process. In a threaded binary tree, NULL pointers are replaced by references of ...
Introduction Hi all, let’s learn today about how to perform Array Rotation. There are various approaches for the same, like the brute force method, the Juggling Algorithm, the Reversal Algorithm, the Block Swap Algorithm, etc. In detail, let’s discuss one ...
Introduction A linked list is a linear data structure that consists of nodes. Each Node contains a data field and a pointer to the next Node. In Linked List, unlike arrays, elements are not stored at contiguous memory locations but ...
Introduction Linked lists are one of the frequently asked data structures in interviews. Some of the questions on the linked list asked in product-based companies like Amazon, Microsoft are Detect And Remove Cycle, Merge two sorted linked lists, etc. This ...
Introduction Problems related to mathematical expressions are found in abundance in almost every coding contest. Balanced parentheses, Infix, postfix, and prefix conversions are some of them. One such problem is checking whether the given mathematical expression contains redundant parenthesis. A ...
Introduction Let’s take a real-life example for overloading and overriding methods in object-oriented programming concepts. Assume you are supposed just to perform the function of talking. Say, you have to tell the story of your day to a total stranger. ...
Introduction A good programmer is the one who can write the most optimized codes. To develop this ability, the knowledge of data structures and algorithms becomes essential. Due to this reason, the knowledge of Data Structures and Algorithms (DSA) is ...
Introduction What comes to your mind when you first hear the word Inheritance? Doesn’t it remind you of how someone at a family gathering said that you inherited your mother’s eyes or father’s hair? Well, that’s what inheritance is, even ...
Introduction In this article, we are going to learn static vs dynamic binding. We will see each of them in detail and then compare them based on their functionalities and where they are used. We know that Object-Oriented Programming is ...
Introduction A doubly-linked list is a data structure that consists of sequentially linked records which are called nodes. A node contains two fields, called links, that refer to the previous and the next node in the sequence of nodes. The ...
