HOME
PARTNERS
CONTACT

Computer Science and Engineering Data Structures – 1 Experiments

Aim

Overview

Pretest

BST

Aim Concept Properties Quiz

BST-Insert

Aim Concept Algorithm Demo Quiz

BST-Search

Aim Algorithm Demo Practice Quiz

BST-Delete

Aim Concept Algorithm Demo Exercise Quiz

Analysis

Aim Overview Uses Relationships Quiz

Posttest

Binary Search Tree

Choose difficulty:

Beginner

Intermediate

Advanced

1. The following values are inserted into the binary search tree in order. Print the inorder traversal of the resulting tree: [6, 3, 9, 1, 10, 8, 7, 2, 5, 4]

a: [6, 3, 9, 1, 10, 8, 7, 2, 5, 4] Explanation

Explanation

b: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] Explanation

Explanation

c: [6, 3, 9, 1, 10, 2, 8, 7, 4, 5] Explanation

Explanation

d: [3, 6, 9, 10, 1, 8, 7, 2, 5, 4] Explanation

Explanation

2. Which of the following sets uniquely determine the binary search tree

a: In Order Traversal Explanation

Explanation

b: Post Order Traversal Explanation

Explanation

c: Pre Order Traversal Explanation

Explanation

d: The inorder traversal is already given by the binary search tree property (that the inorder traversal will be sorted). We need one more traversal in addition to it to know the depths of the branches. Explanation

Explanation

e: Explanation: Explanation

Explanation

3. Which of the following is the resultant tree given the following sequence of insertions:
5, 10, 4, 1, 3, 8, 6

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)