## 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...

Skip to content
## Check Mirror in N-ary Tree

## Print Ancestors of a Given Binary Tree Node without Recursion

## Data Structures in C++ – Trees & Graph

## Level Order Traversal Line Set 3 Using One Queue

## Right View Binary Tree Using Queue

## Check if a given Binary Tree is Heap

## Overview of data structures binary tree, bst, heap, and hash

## Why is Binary Heap Preferred over BST for Priority Queue?

## Convert BST to Min Heap

## Create a Doubly Linked List from the given Ternary Tree

## Convert a given Binary Tree To Doubly Linked List | Set 3

## Construct a Complete Binary Tree from its Linked List Representation

## Merge Two Balanced Binary Trees

## Convert a given Binary Tree to Doubly Linked List

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...

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...

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...

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...

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:...

Problem Statement: Given a binary tree, our task is to check whether the given tree follows the max heap property or not. What is a Binary Tree? Binary tree is...

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...

What is the priority Queue? Basically, Priority queues are abstract data types and are quite similar to queues, however, in the priority queue, there is some priority for every element....

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...

In this blog, we will learn to create a doubly linked list from ternary tree. So, letâ€™s get started with the creation of a doubly linked list from a ternary...

Introduction One of the most crucial data structures to learn while preparing for interviews is the linked list. In a coding interview, having a thorough understanding of Linked Lists might...

This article discusses the most efficient approach to construct a binary tree using a linked list. Constructing binary trees from linked lists will definitely improve your data structures. Having knowledge...

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...

This article will discuss in detail how to convert binary tree to doubly linked list. Conversion of binary tree to doubly linked list is an amazing task, which will improve...