Scribd
Upload
3 views

Tutorial-9_4 _Question

Uploaded by

anshuumaanmathur5
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
3 views

Tutorial-9_4 _Question

Uploaded by

anshuumaanmathur5
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

School of Computer Science Engineering and Technology

Course- BTech Type- Core


Course Code- CSET202 Course Name-Data Structure using C++

Year- 2024 Semester- Odd


Date- 26/9/2024 Batch- Second year

Tutorial 11 SET-B CO-PO


Mapping
Tutorial No. Name CO1 CO2 CO3 CO4
11 Tree Traversal, ---  -- 
Insertion and
Deletion, BST

Question 1. Determine the preorder from the given inorder and postorder for the tree
traversal. Also draw the tree. (8 mins)
Inorder: E A C K G H D B G
Postorder: C K H B G D F A E

Question 2. Determine the postorder from the given inorder and preorder for the tree
traversal.
Also draw the tree. (8 mins)
Inorder: 2,3,1,5,4,7,8,6,9
Preorder: 1,2,3,4,5,6,8,7,9

Question 3. Consider the priority queue in fig given below, which is maintained by a 2D
array QUEUE.

A) Describe the structure after (RRR, 3), (SSS, 4), (TTT, 1), (UUU, 4) and (VVV, 2)
are added to the queue.

B) Describe the structure if, after the preceding insertions, three elements are
deleted. (8 mins)

Practice Problem
Question 4 consider the following deque of characters where DEQUE is a circular
array which is allocated six memory cells:
LEFT = 2, RIGHT = 4, DEQUE:_, A, C, D,_,_
School of Computer Science Engineering and Technology
Describe the deque while the following operations take place, a)
F is added to the right of the deque
b) Two letters on the right are added
c) K, L and M are added to the left is deleted
d) One letter on the left is deleted
e) R is added to the left on the queue
f) S is added to the right of the queue
g) T is added to the right of the queue.

You might also like