Courses
Tutorials
Practice

Balanced Binary Search Trees

19 posts

C++ Program to Count of Array elements greater than all elements on its left and at least K elements on its right

Last Updated: 17 August 2023

Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than all the elements preceding it and strictl...read more

Advanced Data Structure

AVL-Tree

rotation

C++

Balanced Binary Search Trees

C++ Programs

DSA

Java Program to Count of Array elements greater than all elements on its left and at least K elements on its right

Last Updated: 21 March 2023

Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than all the elements preceding it and strictl...read more

Advanced Data Structure

AVL-Tree

rotation

Balanced Binary Search Trees

Java Programs

DSA

Insertion, Searching and Deletion in AVL trees containing a parent node pointer

Last Updated: 21 May 2024

AVL tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees cannot be more than one for all nodes. The insertion ...read more

Balanced Binary Search Trees

Picked

DSA

Minimize array sum by replacing greater and smaller elements of pairs by half and double of their values respectively atmost K times

Last Updated: 02 June 2021

Given an array arr[] consisting of N positive integers and an integer K, the task is to find the minimum possible array sum that can be obtained by repeatedly selecting a ...read more

Balanced Binary Search Trees

C++ Programs

cpp-multiset

DSA

Count of Array elements greater than all elements on its left and at least K elements on its right

Last Updated: 27 May 2024

Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than all the elements preceding it and strictl...read more

Advanced Data Structure

AVL-Tree

rotation

Balanced Binary Search Trees

DSA

Split a BST into two balanced BSTs based on a value K

Last Updated: 04 January 2023

Given a Binary Search tree and an integer K, we have to split the tree into two Balanced Binary Search Tree, where BST-1 consists of all the nodes which are less than K an...read more

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 13

Last Updated: 28 June 2021

Which of the following operations are used by Red-Black trees to maintain balance during insertion/deletion?a) Recoloring of nodesb) Rotation (Left and Right)(A) Only a(B)...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 12

Last Updated: 28 June 2021

Is the following statement valid?A Red-Black Tree which is also a perfect Binary Tree can have all black nodes(A) Yes(B) No Answer: (A) Explanation: A perfect BST with all...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 11

Last Updated: 28 June 2021

What is the worst case possible height of Red-Black tree? Assume base of Log as 2 in all options(A) 2Log(n+1)(B) 1.44 Logn(C) 4Logn(D) None of the above Answer: (A) Explan...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 13

Last Updated: 28 June 2021

Which of the following is true about AVL and Red Black Trees?(A) In AVL tree insert() operation, we first traverse from root to newly inserted node and then from newly ins...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 9

Last Updated: 28 June 2021

Which of the following is true about Red Black Trees?(A) The path from the root to the furthest leaf is no more than twice as long as the path from the root to the nearest...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 13

Last Updated: 28 June 2021

Which of the following is true(A)The AVL trees are more balanced compared to Red Black Trees, but they may cause more rotations during insertion and deletion.(B)Heights of...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 7

Last Updated: 28 June 2021

Consider the following left-rotate and right-rotate functions commonly used in self-adjusting BSTsT1, T2 and T3 are subtrees of the tree rooted with y (on left side) or x ...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 13

Last Updated: 28 June 2021

Which of the following is a self-adjusting or self-balancing Binary Search Tree(A) Splay Tree(B) AVL Tree(C) Red Black Tree(D) All of the above Answer: (D) Explanation: Se...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

Data Structures | Balanced Binary Search Trees | Question 5

Last Updated: 28 June 2021

Consider the following AVL tree. 60 / \ 20 100 / \ 80 120 Which of the following is updated AVL tree after insertion...read more

Data Structures

Data Structures-Balanced Binary Search Trees

Balanced Binary Search Trees

DSA

1 2