CS2402 Quiz: Data Structures and Algorithms - Prof. Martine C. Ceberio, Quizzes of Data Structures and Algorithms

A quiz on data structures and algorithms for a university course cs2402. The quiz includes multiple choice questions on topics such as binary trees, avl trees, and traversal algorithms. Students are required to justify their answers and may lose points for presentation, readability, and completeness. The quiz covers topics like binary search trees, avl trees, and traversal algorithms.

Typology: Quizzes

Pre 2010

Uploaded on 08/18/2009

koofers-user-o31
koofers-user-o31 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Data Strutures and Algorithms CS2402
Q
uiz
5
14 points - 20 minutes
Make sure that you justify all your answers. Up to 2 points may be taken o if the
larity of presentation, readability, and ompleteness explanations is an issue.
Exerise 1 (
2
points)
What is a binary searh tree?
Exerise 2 (
2
points)
What is an AVL tree?
Exerise 3 (
4
points)
Given the following sequene of numbers: 10, 1, 20, 25, 7, 3,
15, build the orresponding binary searh tree.
Exerise 4 (
2
points)
Give the pseudo-ode of the reursive algorithm for the post-
order traversal of a binary tree.
Exerise 5 (
4
points)
Give the pseudo-ode of the in-order traversal of a binary tree,
using a stak.
1

Partial preview of the text

Download CS2402 Quiz: Data Structures and Algorithms - Prof. Martine C. Ceberio and more Quizzes Data Structures and Algorithms in PDF only on Docsity!

Data Stru tures and Algorithms  CS

Quiz 5

14 p oints - 20 minutes

Make sure that you justify all your answers. Up to 2 p oints may b e taken o if the larity of presentation, readability, and ompleteness explanations is an issue.

Exer ise 1 ( 2 p oints) What is a binary sear h tree?

Exer ise 2 ( 2 p oints) What is an AVL tree?

Exer ise 3 ( 4 p oints) Given the fol lowing sequen e of numbers: 10, 1, 20, 25, 7, 3, 15, build the orresponding binary sear h tree.

Exer ise 4 ( 2 p oints) Give the pseudo- ode of the re ursive algorithm for the post- order traversal of a binary tree.

Exer ise 5 ( 4 p oints) Give the pseudo- ode of the in-order traversal of a binary tree, using a sta k.