# Tag Archives: Data Structures-Binary Search Trees (adsbygoogle = window.adsbygoogle || []).push({});

## Data Structures | Binary Search Trees | Question 12

Consider the same code as given in above question. What does the function print() do in general? The function print() receives root of a Binary… Read More »

## Data Structures | Binary Search Trees | Question 12

Consider the following code snippet in C. The function print() receives root of a Binary Search Tree (BST) and a positive integer k as arguments.… Read More »

## Data Structures | Binary Search Trees | Question 10

Which of the following traversals is sufficient to construct BST from given traversals 1) Inorder 2) Preorder 3) Postorder (A) Any one of the given… Read More »

## Data Structures | Binary Search Trees | Question 12

Consider the following Binary Search Tree 10 / \ 5 20 / / \ 4 15 30 / 11 If we randomly search one of… Read More »

## Data Structures | Binary Search Trees | Question 8

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is… Read More »

## Data Structures | Binary Search Trees | Question 7

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the… Read More »

## Data Structures | Binary Search Trees | Question 6

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree.… Read More »

## Data Structures | Binary Search Trees | Question 5

Which of the following traversal outputs the data in sorted order in a BST? (A) Preorder (B) Inorder (C) Postorder (D) Level order Answer: (B)… Read More »

## Data Structures | Binary Search Trees | Question 4

How many distinct binary search trees can be created out of 4 distinct keys? (A) 4 (B) 14 (C) 24 (D) 42 Answer: (B) Explanation:… Read More »

## Data Structures | Binary Search Trees | Question 3

We are given a set of n distinct elements and an unlabeled binary tree with n nodes. In how many ways can we populate the… Read More »

## Data Structures | Binary Search Trees | Question 2

In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right… Read More »

## Data Structures | Binary Search Trees | Question 1

What is the worst case time complexity for search, insert and delete operations in a general Binary Search Tree? (A) O(n) for all (B) O(Logn)… Read More »