## Create a Binary Search Tree from an array

Lets discuss how to create a BST From an array. (more…)

## Remove Duplicate Elements from a Sorted Singly Linked List

Lets remove all duplicate elements from a sorted singly linked list. (more…)

## Reverse a Singly Linked List in a Single Iteration

Suppose we have a linked list and we want to reverse it in Single iteration and O(n) complexity. (more…)

## Create a Singly Linked List from an array

Suppose we have an int array and we want to create it into a singly linked list from it. (more…)

## Finding paths in a Binary Tree

Many times we need to search for some specific paths in a binary tree from top to bottom. Lets design a code to find out all paths in a binary…

## Finding nth Largest and Smallest Node in Binary Seach Tree

Binary Search Tree (more…)

## Converting a Binary Search Tree to a Sorted Doubly Linked List

Change the left and right pointers of each node in Binary search Tree to make it a sorted doubly linked list. (more…)

## Designing a Binary Search Tree Validation class

Many times we need to validate a Binary Search tree verifying its properties, (more…)

## Binary Tree Traversal with Strategy design pattern and open-closed principle

Many time we need to perform certain tasks on Binary trees. These tasks can be, Counting nodes that satisfy some criteria. Displaying all nodes in particular pattern like, printing expression…