## Find k’th smallest node in a Binary Search Tree (BST)

Given a Binary Search Tree (BST) and a positive number k, find the K-th smallest node in it.

Coding made easy

Given a Binary Search Tree (BST) and a positive number k, find the K-th smallest node in it.

Convert a given binary tree to BST (Binary Search Tree) by keeping original structure of the binary tree intact.

Given a normal binary tree, convert it to Left-child right-sibling (LC-RS) binary tree.

Given a binary tree, write an efficient algorithm to print two-dimensional view of a binary tree.

In this post, we will discuss C++ implementation of Trie Data Structure which supports insertion, deletion and search operations.

Given a dictionary of words where each word follows a CamelCase notation, find all words in the dictionary which matches with the given pattern consisting of all uppercase characters.

Given an ancestor matrix, whose cell (i, j) has value true if i is ancestor of j in a binary tree, construct a binary tree from it where binary tree nodes are labelled from 0 to n-1 where n is the size of the ancestor matrix.

Write an algorithm to compute the height of a binary tree with leaf nodes forming a circular doubly linked list where the left and right pointers of the leaf node will act as a previous and next pointer of circular doubly linked list respectively. For example, consider below binary tree. The leaf nodes are …

Write an efficient algorithm to replace every element of a given array with the least greater element on its right or with -1 if there are no greater element.

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.

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.

A Treap Data Structure is basically a combination of a binary search tree and a heap. Binary Search Trees – Deletions and additions of nodes can make the tree unbalanced (heavier on sides, therefore, the property we value about BSTs, the ability to distribute data by equal divisions, goes out of whack). Therefore we …