Scribd
Upload
4 views3 pages

ADS (Tutorials)

This tutorial sheet for the Advanced Data Structures course covers topics related to trees, including definitions, types, and dynamic memory allocation. It includes various problems and tasks for students to complete, such as defining tree concepts, implementing algorithms, and constructing binary search trees. The tutorial is scheduled for December 31, 2025, and is prepared by S. Ravi from the Department of Computer Science and Engineering.

Uploaded by

madhudanaveni8
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
4 views3 pages

ADS (Tutorials)

This tutorial sheet for the Advanced Data Structures course covers topics related to trees, including definitions, types, and dynamic memory allocation. It includes various problems and tasks for students to complete, such as defining tree concepts, implementing algorithms, and constructing binary search trees. The tutorial is scheduled for December 31, 2025, and is prepared by S. Ravi from the Department of Computer Science and Engineering.

Uploaded by

madhudanaveni8
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

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING KAKATIYA INSTITUTE OF

TECHNOLOGY & SCIENCE, WARANGAL


(An Autonomous Institute under Kakatiya University, Warangal)

TUTORIAL 1

Course Code / Name U18CS611–Advanced Data Structures Branch ECE

Semester VI Section I

Tutorial Sheet posted Tutorial Class B1: 31.12.2025


23-12-2025
in course web on Scheduled on B2: 31.12.2025

Topics Covered Trees: Introduction, types of trees.

Tutorial P. No. Tutorial Problem CO CDLL


No.
Introduction to Non linear Data Structures.[10] CO1 [An]
1. a) Define a Tree and types of trees with examples.[R]-[2]
b) What are linear and non linear datastructures[U]-[[3]
c) Differentiate between linear and non linear data structures with
examples.[An]-[5M]
Implementation of DMA in Non linear data CO1 [Ap]
2. structures[10]
a) What is Dynamic memory allocation .[R]-[2]
b) Explain the methods in DMA.[U]-[3]
c) Develop a C code to allocate memory dynamically
to use in trees[Ap]-[5]

T-1
Terminology of Trees and Types of Trees.[10] CO1 [An]
3 a) Define height and path in a Binary tree[R]-[2]
b) What is Complete binary tree,Give an example.[U]-[3]
c) Differentiate between Binary tree, Complete binary tree and
Full binary tree.[An]-[5]

An operating system (OS) needs to allocate memory CO1 [Ap]


blocks of various sizes (integers) to programs
efficiently using Binary search Tree[10].
4.
a)Define Binary Search Tree[R]-[2]
b)Explain the Search operation in a BST with an algorithm.[U]-[3]
c) Construct a Binary search tree from the following elements.
89,23,65,14,56,29,32. [Ap]-[5]

Implement a binary tree data structure to store the plant CO1 [Ap]
5. information, including the price of each plant. The application
should allow users to enter the plant prices one by one, and build
a binary tree based on the input while maintaining the hierarchical
relationship between plants.[10]
a) Write an algorithm for Pre order traversal using recursion[R]-[2]
b) Show the Pre order traversal for the tree.[U]-[3]
c) calculate the sum of the prices of all the plants in the collection
using Pre order traversal.[Ap]-[5]

Seema is tasked with implementing a program that creates a CO1 [Ap]


binary search tree using an array of integers as input. The
6. program should then print the tree Inorder traversal.[10]
a) Write an algorithm for In order traversal using recursion.[R]-[2]
b) Show the In order traversal for the tree.[U]-[3]
c) implement a program that can delete a node from a BST based
on the given key value and print the remaining nodes in an in-
order traversal.[Ap]-[5]

Prepared by:
S,Ravi
Dept. of CSN

You might also like