Print Right View of a Binary Tree
Given a binary tree, write an efficient algorithm to print right view of given binary tree.
Category: Tree
Remove nodes from BST that have keys outside the valid range
Given a BST and a valid range of keys, remove nodes from BST that have keys outside the valid range.
Print leaf to root path for every leaf node in a binary tree
Given a binary tree, write an iterative algorithm to print leaf to root path for every leaf node of binary tree. Use of Recursion is prohibited.
Find a pair with given sum in a BST
Given a binary search tree, find a pair with given sum present in it.
Find maximum width of given binary tree
Given a binary tree, write an efficient algorithm to compute maximum width of it.
Build Binary Tree from given Parent array
Given an array A which represents a binary tree such that the parent-child relationship is defined by (A[i], i) for every index i in the array A, build binary tree out of it.
Word Break Problem | Using Trie Data Structure
Given a string and a dictionary of words, determine if string can be segmented into a space-separated sequence of one or more dictionary words.
Invert Binary Tree | Recursive and Iterative solution
Given a binary tree, write an efficient algorithm to invert binary tree.
Convert a Binary Tree to BST by maintaining its original structure
Convert a given binary tree to BST (Binary Search Tree) by keeping original structure of the binary tree intact.
Convert normal binary tree to Left-child right-sibling binary tree
Given a normal binary tree, convert it to Left-child right-sibling (LC-RS) binary tree.
C++ Implementation of Trie Data Structure
In this post, we will discuss C++ implementation of Trie Data Structure which supports insertion, deletion and search operations.
Huffman Coding Compression Algorithm
Huffman Coding (also known as Huffman Encoding) is a algorithm for doing data compression and it forms the basic idea behind file compression. This post talks about fixed length and variable length encoding, uniquely decodable codes, prefix rules and construction of Huffman Tree.