Construct a binary tree from inorder and postorder traversals
Write an efficient algorithm to construct a binary tree from the given inorder and postorder traversals.
Tag: Hashing
Clone a linked list with random pointer
Write an efficient code to clone a linked list with each node containing an additional random pointer. The random pointer can point to any random node of the linked list or null.
Convert a binary tree into a doubly-linked list in spiral order
Given a binary tree, convert it into a doubly-linked list following the spiral order.
Clone a binary tree with random pointers
Write an efficient code to clone a binary tree with each node containing an additional random pointer. The random pointer can point to any random node of the binary tree or can be null.
Construct a binary tree from inorder and preorder traversal
Write an efficient algorithm to construct a binary tree from the given inorder and preorder sequence.
Shuffle an array according to the given order of elements
Given an array of distinct integers, shuffle it according to the given order of elements.
Construct a full binary tree from a preorder and postorder sequence
A full binary tree is a tree in which every node has either 0 or 2 children. Write an efficient algorithm to construct a full binary tree from a given preorder and postorder sequence.
Find correct order of alphabets in a given dictionary of ancient origin
Given a dictionary of ancient origin where the words are arranged alphabetically, find the correct order of alphabets in the ancient language.
Efficiently print all nodes between two given levels in a binary tree
Given a binary tree, efficiently print all nodes between two given levels in a binary tree. The nodes for any level should be printed from left to right.
Link nodes present in each level of a binary tree in the form of a linked list
Given a binary tree, write an efficient algorithm to link nodes at the same level in the form of a linked list like structure.
Find preorder traversal of a binary tree from its inorder and postorder sequence
Write an efficient algorithm to find a binary tree’s preorder traversal from its inorder and postorder sequence without constructing the tree.
Find all symmetric pairs in an array of pairs
Given an array of pairs of integers, find all symmetric pairs, i.e., pairs that mirror each other. For instance, pairs (x, y) and (y, x) are mirrors of each other.