## Root to leaf path sum equal to a given number in BST

Given a BST and a number. The task is to check whether the given number is equal to the sum of all the node from… Read More »

Quick Links for Binary Search Trees

Recent Articles |

Practice Problems |

Quizzes on BST |

Quizzes on Balanced BST |

Videos |

Basic |

Binary Search Tree | Set 1 (Search and Insertion) |

Binary Search Tree | Set 2 (Delete) |

Advantages of BST over Hash Table |

Explore more... |

Given a BST and a number. The task is to check whether the given number is equal to the sum of all the node from… Read More »

Given a BST and a key Node, find the total sum in BST, except those Node which are adjacent to key Node. Examples: Recommended: Please… Read More »

Given a preorder traversal of a BST. The task is to find the number of elements less than root. Examples: Input: preorder[] = {3, 2,… Read More »

Consider a problem where same elements are likely to be searched again and again. Implement search operation efficiently. Examples : Input : arr[] = {12… Read More »

Given an array of positive and negative integers and an integer K. The task is to find the subarray which has its sum closest to… Read More »

Given an array, print the Next Greater Element (NGE) for every element. The Next greater Element for an element x is the first greater element… Read More »

Given a Binary Search Tree and a number x, find floor of x in the given BST. Input : x = 14 and root of… Read More »

Online Round: This round was held on Hackerrank for 1:30 hrs. There were two questions in this round. A tree was given with upto 10^5 nodes.… Read More »

Nutanix Technologies came to our campus BITS Goa for On-Campus Recruitment process. They conducted multiple rounds of screening to finally select 3 Candidates. Online Test:… Read More »

Given a binary search tree and a number N, the task is to find the sum of the cousins of the given node N if… Read More »

Round: I An Array arr={7, 7, 8, 8, 9, 1, 1, 4, 2, 2} has numbers appearing twice or once. Duplicates appear side by side… Read More »

Round 1: Round 1 was for 200 marks. 25 MCQs and 2 coding questions .The MCQs were mostly on aptitude and some were Technical (C++… Read More »

There were a total of 3 rounds. 1st was online coding, 2nd was written coding and last round was divided in three parts, basically 3… Read More »

Given a BST and a key. The task is to find the inorder successor and predecessor of the given key. In case, if either of… Read More »

Given an array representing preorder traversal of BST, print its postorder traversal. Examples: Input : 40 30 35 80 100 Output : 35 30 100… Read More »