# Category Archives: Advanced Data Structure

## 2-3 Trees | (Search and Insert)

2-3 tree is a tree data structure in which every internal node (non-leaf node) has either one data element and two children or two data… Read More »

## Sort elements by frequency | Set 5 (using Java Map)

Given an integer array, sort the array according to the frequency of elements in decreasing order, if frequency of two elements are same then sort… Read More »

## Accolite Interview Experience (On-campus)

Accolite hiring process include 6 rounds. 1.First Round::First round is online round, which has 30 MCQs.Accolite uses their own product called Eduthrill to conduct online… Read More »

## Minimum changes required to make two arrays identical

Given two arrays and with n elements each. The task is to make these two arrays identical i:e, for each , we want to make… Read More »

## Search an Element in Doubly Circular Linked List

Pre-requisite: Convert an Array to a Circular Doubly Linked List, Doubly Circular Linked List Given a Doubly circular linked list. The task is to find… Read More »

## Program for assigning usernames using Trie

Suppose there is a queue of n users and your task is to assign a username to them. The system works in the following way.… Read More »

## Level Ancestor Problem

The level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a… Read More »

## Insertion at Specific Position in a Circular Doubly Linked List

Prerequisite: Insert Element Circular Doubly Linked List. Convert an Array to a Circular Doubly Linked List. Given the start pointer pointing to the start of… Read More »

## Convert an Array to a Circular Doubly Linked List

Prerequisite: Doubly Linked list, Circular Linked List, Circular Doubly Linked List Given an array of N elements. The task is to write a program to… Read More »

## C++ Program to implement Symbol Table

Prerequisite: Symbol Table A Symbol table is a data structure used by the compiler, where each identifier in program’s source code is stored along with… Read More »

## Iterative Preorder Traversal of an N-ary Tree

Given a K-ary Tree. The task is to write an iterative program to perform the preorder traversal of the given n-ary tree. Examples: Input: 3-Array… Read More »

## Flatten a binary tree into linked list | Set-2

Given a binary tree, flatten it into a linked list. After flattening, the left of each node should point to NULL and right should contain… Read More »

## Iterative Segment Tree (Range Maximum Query with Node Update)

Given an array arr[0 . . . n-1]. The task is to perform the following operation: Find the maximum of elements from index l to… Read More »

## Print the DFS traversal step-wise (Backtracking also)

Given a graph, the task is to print the DFS traversal of a graph which includes the every step including the backtracking. 1st step:- 0… Read More »

## Queries to find maximum product pair in range with updates

Given an array of N positive integers. The task is to perform the following operations according to the type of query given. 1. Print the… Read More »