Given an array A[ ] consisting of N distinct integers, the task is to find the number of elements which are strictly greater than all… Read More

# Tag Archives: Balanced Binary Search Trees

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… Read More

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… Read More

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… Read More

Which of the following operations are used by Red-Black trees to maintain balance during insertion/deletion? a) Recoloring of nodes b) Rotation (Left and Right) (A)… Read More

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:… Read More

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)… Read More

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… Read More

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… Read More

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… Read More

Consider the following left-rotate and right-rotate functions commonly used in self-adjusting BSTs T1, T2 and T3 are subtrees of the tree rooted with y (on… Read More

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… Read More

Consider the following AVL tree. 60 / \ 20 100 / \ 80 120 Which of the following is updated AVL tree after insertion of… Read More