HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClassesGroups

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Blog

Account

  • Dashboard
  • My Content
  • Profile
  • Log in
© 2026 senLearn. All rights reserved.HelpAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Python Going Further
  3. /Data Structures

Data Structures

Python Programming
+ Upload a Problem
More in Python Going FurtherClasses and ObjectsInheritance and Special MethodsFiles and Data FormatsComprehensions, Iterators and GeneratorsData StructuresTesting and Debugging
11 problems
Type:
1.
A network has the links A to B, B to C, D to E, and F alone.
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Medium
2.
In the friends graph of the lesson, find by breadth-first search, on paper, the shortest path from…
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Medium
3.
From the dictionary of friends in the lesson, write a function that gives the person with the most…
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Easy
4.
What is the height of the tree made by inserting 5, 3, 8, 1, 4, 7, 9 in that order, and of the one…
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Medium
5.
Insert the values 50, 30, 70, 20, 40, 60, 80, 30 into an empty binary search tree, in that order.
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Easy
6.
Write a function that finds the value of the middle node of a chain in one pass, without counting…
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Hard
7.
A chain holds 1, 2, 3, 4. Show, by following the links, what remove(head, 1) and remove(head, 3)…
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Medium
8.
A chain of nodes holds 3, 1, 4, 1, 5, built as in the lesson.
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Easy
9.
For each job, say whether a stack or a queue fits, and why.
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Easy
10.
Customers arrive and are served one at a time, each needing some minutes: Asha 4, Ravi 2, Meera 6.
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Medium
11.
Use a stack to write a function reverse_words(sentence) that reverses the order of the words of a…
High School (11–12), High School (9–10), Undergraduate, General · Data StructuresStemPy LabStemPy Lab
Easy