Skip to content
VUBuddy

CS301P Lab Quiz 5 by Sahirullah

Data Structures (Practical) PDF 16 KBUpdated 23 Oct 2026
Quiz CS301P Lab Quiz 5 by Sahirullah PDF 16 KB
vubuddy.com
Type
Quiz
Course
CS301P Data Structures (Practical)
Size
PDF 16 KB
Updated
23 Oct 2026
Free download 0 of 3 used today
Download free · 16 KB

You get 3 free files a day on the website. Add the Chrome extension for 30 a day.

Unlimited downloads in the Android app Get it free on Google Play

Preview text

Text from page 1 of 2. Download the file for all 2 pages.

CS301P LAB 5 QUIZ SOLVED BY SAHIRULLAH

Q1. Which of the following condition will be true if a node is NULL during the in- order traversal using recursive calls?

Node can contain only one child Node contains only right child Node contains only left child

Node does not contain both left and right children ✔

Q2. Which of the following is visited at last step in post-order traversal method?

Right Node Leaf Node Left Node

Root Node ✔

Q3. Level order traversal of a binary tree can be implemented with ________ data structure.

Linked List

Queue ✔

Binary Tree Stack

Q4. Which of the following traversal method will be used, if we want the output as 3,4,7,9,14,15,16,18,20?

Level-order traversal Preorder traversal

In-order traversal ✔

Post-order traversal Data Structures (Practical) - Revision Guide

All CS301P files →
CS301P Data Structures (Practical) All CS301P handouts, past papers, quizzes and MCQs in one place. Open course page

Get more out of VUBuddy, for free

Android app Free on Google Play
  • Unlimited downloads
  • The explanation behind every MCQ answer
  • Study offline on slow data
Get the Android app
Chrome extension Free on the Chrome Web Store
  • 30 downloads a day instead of 3
  • Sign in and buy Pro Semester here
Add to Chrome

One Pro Semester membership works in both the extension and the app.