Scribd
Upload
2 views1 page

Tutorial 08

The document is a lab sheet focused on Depth First Traversal (DFT) in data structures and algorithms. It includes questions about the types of DFT, explanations of traversal methods, terminology used in trees, and practical applications of DFT. Additionally, it provides a task involving the construction of a binary search tree from a given array and requires outputs of various tree traversal methods.

Uploaded by

stjayasingha16
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

Tutorial 08

The document is a lab sheet focused on Depth First Traversal (DFT) in data structures and algorithms. It includes questions about the types of DFT, explanations of traversal methods, terminology used in trees, and practical applications of DFT. Additionally, it provides a task involving the construction of a binary search tree from a given array and requires outputs of various tree traversal methods.

Uploaded by

stjayasingha16
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Data Structures and Algorithms

Depth First Traversal


Lab Sheet 08

Answer all questions.


1. What are the three types of Depth First Traversal (DFT)?
2. Briefly explain the identified traversal methods.
3. Explain the terms used in trees.
4. You have been given the following integer array,
Array: 6, 19, 3, 4, 2, 30, 12, 15, 7.
(a) Draw a binary search tree based on the given array.
(b) Get the outputs of post-order, pre-order, and in-order using the tree that you
identified.
5. Identify the practical use of the types of DFT types.

Faculty of Computing - NSBM Green University Town page. 1

You might also like