Binary Search Tree Insertion operation relies on the search operation. The aim of search operation in insertion is to find a node that can be parent of the new node. …

# Category: Data Structures

Binary tree is a non-sequential or non-linear data structure used to represent hierarchical relationship among elements. You can add maximum two child nodes under any node of the binary tree. …

Postorder Traversal is done by traversing the left and right child nodes of a node binary tree or subtree before the node. In short it is termed as Left-Right- Root.…

Inorder traversal in a binary tree defines that the root node of a tree/ subtree is visited after its left child node and before its right child node. It can…

Preorder Traversal in a binary tree defines that the root node of a tree/ subtree is visited before its left and right child nodes. It can be defined as Root-Left-Right.…

Arithmetic involves creating arithmetic expressions using binary operators. Binary operators are the arithmetic operators that require two operands for evaluation. + (addition),-(subtraction), /(division) and * (multiplication) are binary operators. Any…

Traversal is an essential operation of any data structure. It is the process of reaching out to or visiting every element stored in the data structure at least once. Unlike…

Many tasks in an operating system require Queue application. Queues can be used for scheduling OS tasks by maintaining their job details and its sequence of execution in all the…

A binary tree is a non-linear data structure to maintain binary relationships among elements. Binary trees are special trees where a node can have maximum two child nodes. These are…

Quicksort is a sorting technique with algorithmic complexity of O(nlogn). This sorting technique too falls under divide and conquer technique like Merge Sort. In this post we will discuss the…