https://uadoc.uacdn.net/doubts/4370F2DXXV/1635323028B6LIG0M9.JPEG

Problem-72
Given a BST of size n, in which each node r has an additional field r ? size, the number of the
keys in the sub-tree rooted at r (including the root node r). Give an O(h) algorithm GreaterthanConstant(r, k) to
find the number of keys that are strictly greater than k (h is the height of the binary search tree).


English

Educator solution

CS & IT

GATE - CSIT, DSAI & Interview Preparation

GATE, ESE and IIT-JAM

Ace the toughest competitive and government exams in India 

Doubt solution

Doubt details

CS & IT

AUTO-GENERATED

Solutions available

Educator solution