## Minimum number of nodes in an AVL Tree with given height

Given the height of an AVL tree ‘h’, the task is to find the minimum number of nodes the tree can have. Examples : Input… Read More »

- AVL Tree | Set 1 (Insertion)
- How to determine if a binary tree is height-balanced?
- B-Tree | Set 1 (Introduction)
- Red-Black Tree | Set 1 (Introduction)
- AVL Tree | Set 2 (Deletion)
- Red-Black Tree | Set 2 (Insert)
- Advantages of BST over Hash Table
- Applications of tree data structure
- Red-Black Tree | Set 3 (Delete)
- Overview of Data Structures | Set 2 (Binary Tree, BST, Heap and Hash)
- Merge Two Balanced Binary Search Trees
- C Program for Red Black Tree Insertion
- Count smaller elements on right side
- How to handle duplicates in Binary Search Tree?
- Why is Binary Heap Preferred over BST for Priority Queue?
- Splay Tree | Set 1 (Search)
- Sort an array according to absolute difference with given value
- Tree Sort
- Check if a given Binary Tree is height balanced like a Red-Black Tree
- Treap (A Randomized Binary Search Tree)
- Maximum subarray sum modulo m
- Splay Tree | Set 2 (Insert)
- Minimum Possible value of |ai + aj - k| for given array and k.
- Red Black Tree vs AVL Tree
- Find N'th item in a set formed by sum of two arrays
- proto van Emde Boas Trees | Set 1 (Background and Introduction)
- Queries to add, remove and return the difference of maximum and minimum.
- ScapeGoat Tree | Set 1 (Introduction and Insertion)
- How to sort a big array with many repetitions?
- Left Leaning Red Black Tree (Insertion)

Given the height of an AVL tree ‘h’, the task is to find the minimum number of nodes the tree can have. Examples : Input… Read More »

Given an array of N numbers, find length of the longest subarray such that K is the second largest element on insertion. Examples: Input: a[]… Read More »

Given Q queries. The queries are of three types and are described below: Add the number num to the list. Remove the number num from… Read More »

In this post we will compare Red Black Tree and AVL Tree. Red Black Tree: Properties: Self-Balancing is provided by painting each node with one… Read More »

Tango Tree is an online algorithm. It is a type of binary search tree. It is better than the offline weight balanced binary search tree… Read More »

Prerequisites : Red – Black Trees. A left leaning Red Black Tree or (LLRB), is a variant of red black tree, which is a lot… Read More »

You are given an array of n integer and an integer K. Find the number of total unordered pairs {i, j} such that absolute value… Read More »

Given two sorted arrays, we can get a set of sums(add one element from the first and one from second). Find the N’th element in… Read More »

Given an array of n elements and an integer m. The task is to find the maximum value of the sum of its subarray modulo… Read More »

A ScapeGoat tree is a self-balancing Binary Search Tree like AVL Tree, Red-Black Tree, Splay Tree, ..etc. Search time is O(Log n) in worst case.… Read More »

Given an array of n distinct elements and a number x, arrange array elements according to the absolute difference with x, i. e., element having… Read More »

Given an array of distinct positive integers, the task is to find the maximum product of increasing subsequence of size 3, i.e., we need to… Read More »

Tree sort is a sorting algorithm that is based on Binary Search Tree data structure. It first creates a binary search tree from the elements… Read More »

Let us consider the below problem statement and think of different solutions for it. Given a set S of elements such that the elements are… Read More »

We have discussed Overview of Array, Linked List, Queue and Stack. In this article following Data Structures are discussed. 5. Binary Tree 6. Binary Search… Read More »