Invert alternate levels of a perfect binary tree
Write an efficient algorithm to invert alternate levels of a perfect binary tree.
Category: Tree
Construct a binary tree from inorder and level order sequence
Write an efficient algorithm to construct a binary tree from given inorder and level-order sequence.
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.
Convert a Binary Search Tree into a Min Heap
Given a binary search tree (BST), efficiently convert it into a min-heap. In order words, convert a binary search tree into a complete binary tree where each node has a higher value than its parent’s value.
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.
Threaded Binary Tree – Overview and Implementation
This post will explore a threaded binary tree and convert a normal binary tree into a threaded binary tree.
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.
Check if a binary tree is a min-heap or not
Given a binary tree, check if it is a min-heap or not. In order words, the binary tree must be a complete binary tree where each node has a higher value than its parent’s value.
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.
Find a triplet with the given sum in a BST
Given a binary search tree, find a triplet with a given sum present in it.
Merge two BSTs into a doubly-linked list in sorted order
Given two binary search trees, merge them into a doubly-linked list in sorted order.
Construct a height-balanced BST from an unbalanced BST
Given a binary search tree (BST), convert it into a height-balanced binary search tree. For a height-balanced binary search tree, the difference between the height of the left and right subtree of every node is never more than 1.