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

1. The number of edges from the root to the node is called __________ of the tree.

a: Length b: Width c: Depth d: Height

2. The number of edges from the node to the deepest leaf is called _________ of the tree.

a: Height b: Depth c: Width d: Length

3. What is a full binary tree?

a: Each node has exactly two children b: Each node has exactly one or two children c: Each node has exactly zero or two children d: All the leaves are at the same level

4. What is a complete binary tree?

a: A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right b: Each node has exactly zero or two children c: A tree In which all nodes have degree 2 d: A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left

5. Which of the following is not an advantage of trees?

a: Hierarchical structure b: Router algorithms c: Faster search d: Undo/Redo operations in a notepad

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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