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.
Category: Trees
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 given 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.
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.
Check if given binary tree is height balanced or not
Given a binary tree, write an efficient algorithm to check if tree is height balanced or not. In a height balanced tree, the absolute difference between height of left subtree and right subtree for every node is 0 or 1.
C++ Program to Print Binary Tree Structure
Given a binary tree, write an efficient algorithm to print binary tree structure in standard output.
Floor and Ceil in a Binary Search Tree
Given a BST, find ceil and floor of a given key in it. If the given key lie in the BST, then both floor and ceil is equal to that key, else ceil is equal to next greater key (if any) in the BST and floor is equal to previous greater key (if any) in …