Expression Tree in Data Structure
A data structure called an expression tree is used to describe expressions that take the shape of trees. After creating an expression's expression tree, we may execute inorder traversal to...
Red Black Tree in Data Structure
Red Black Tree is a type of balanced Binary Search Tree that uses a unique set of principles to ensure that the tree remains balanced at all times. Let us...
Diameter of a Binary Tree
During an interview related to technical fields like Software engineer, product manager, etc. You will be asked questions based on data structures and algorithms and among all the data structures...
Tree Traversal : Inorder, Preorder and Postorder
Tree Traversal is described as the process of travelling across all the nodes in a tree data structure such that no node is left unvisited in the path. There are...
Array Representation of Binary Tree
In this article, we will discuss the array representation of binary trees but before diving directly into our topic we will know about binary trees in detail the critical terminologies...
Spanning Tree in Data Structure
In this article, we are going to discuss the Spanning tree. This is one of the most important topics of data structure. First, we will study what is an undirected...
AVL Tree in Data Structure
In this article, we will learn what is AVL tree in data structure, what are different rotations in the AVL tree, the operations of the AVL tree in data structure,...
B+ Tree in Data Structure
In this article, we will learn what is the b+ tree in data structure, how to insert, delete and search a node in b+ tree, how to write b+ tree...
Splay Tree in Data Structure
In this article, we will discuss what is a splay tree in data structure. We will discuss what a splay tree is, its different rotations, and its implementation programs in...
Application of Tree in Data Structure
In this article, we are going to study the application of tree in data structure. We will also dig into the working of hierarchical data structure, the trees and how...
Tree in Data Structure: Definition, Types, and Traversing
In this article, we will discuss the tree data structure. We will discuss what a tree data structure is, what are its different types, and different tree traversals. So, let’s...
What is Binary Tree in Data Structure?
In this article, we will discuss binary tree in data structure. This is one of the most important topics of data structure. Binary Tree in Data Structure A binary tree...
Check Mirror in N-ary Tree
Problem Statement: You are given 2 N-ary trees. You have to determine whether the 2 trees are mirror images of each other or not. You have to print “true” if...
Print Ancestors of a Given Binary Tree Node without Recursion
Problem statement You are given a binary tree and a key node. Your task is to print all the ancestors of the given key node. Input: Root of the binary...
Data Structures in C++ – Trees & Graph
In this tutorial, we’ll deep dive into the Data Structures in C++ topics majorly on trees and graphs. We know that data structures are very important and play a crucial...
Level Order Traversal Line Set 3 Using One Queue
Problem Statement: Given a binary tree, print the nodes level by level or level wise and each level on a new line. Queue A queue is basically a linear data...
Right View Binary Tree Using Queue
Problem Statement: The problem is straightforward: we have given a binary tree and we have to print the right view of the binary tree. Let's discuss it with an example:...
Overview of data structures binary tree, bst, heap, and hash
Binary Tree: A Binary tree is a tree data structure in which each node has at most two children i.e. the left child and right child. Representation: A binary tree...
Why is Binary Heap Preferred over BST for Priority Queue?
Binary heaps and BSTs differ in their structure, operations, and use cases. Binary heaps excel at providing efficient priority queue operations and have a simple structure. They are well-suited for...
Convert BST to Min Heap
Problem Statement: In this problem, we will be given a binary search tree and we have to convert the Binary search tree into a min-heap. This condition is applied to...
Merge Two Balanced Binary Trees
Introduction The linked list is one of the most important concepts and data structures to learn while preparing for interviews. Having a good grasp of Linked Lists can be a...