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

Further Readings/References

Feedback

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

Further Readings/References

Feedback

Binary Search Tree

Choose difficulty:

Beginner

Intermediate

Advanced

1. Time complexity of searching in a binary search tree is

a: O(n^2) Explanation

Explanation

b: O(n log n) Explanation

Explanation

c: O(n) Explanation

Explanation

d: O(log n) Explanation

Explanation

2. Time complexity of deleting from a binary search tree is

a: O(n^2) Explanation

Explanation

b: O(n log n) Explanation

Explanation

c: O(n) Explanation

Explanation

d: O(log n) Explanation

Explanation

3. Time complexity of deleting from a balanced binary search tree is

a: O(n^2) Explanation

Explanation

b: O(n log n) Explanation

Explanation

c: O(n) Explanation

Explanation

d: O(log n) Explanation

Explanation

4. If all the queries in a BST come after all the insertions and deletions, then which of the following algorithms is faster than a BST at the same task:

a: Sorting and two pointers Explanation

Explanation

b: Sorting and binary search Explanation

Explanation

c: Binary Search and two pointers Explanation

Explanation

d: Merge Sort Tree Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

Contact Us Phone: General Information: 011-26582050 Email: support@vlabs.ac.in

Follow Us

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