Python: Trees

Included in the course

What you'll learn

• Understand the principles of tree structure and construction
• Represent in code and process data with a recursive nature
• Build abstractions on top of tree-like data structures
• Use a functional paradigm

Description

In this course, we will discuss how to work with tree-like data structures. You'll learn to represent recursive data in code and build abstractions using trees. You will also learn to use tree processing algorithms and traversal in depth. The knowledge from this course will help programmers organize work with any tree structure: a file system, DOM elements, or a product catalog. To make learning easier, it's worth repeating collections, functions, and declarative programming beforehand.

Course program

• 1

  Introduction

  Getting to know the course and its objectives

  theory
• 2

  Definitions

  Understanding the terminology related to trees

  theory
• 3

  Virtual file system

  Introducing a library for creating files in memory

  theory
• 4

  Manipulating the virtual file system

  Learning to modify the file system in an immutable way

  theory
• 5

  Traversal

  Introducing the concept of tree traversal

  theory
• 6

  Aggregation

  Learning how to extract the necessary data from the tree

  theory
• 7

  Aggregation 2

  Discovering how to get a compound array by traversing trees

  theory
• 8

  Accumulator

  Learning to collect additional data while traversing the tree

  theory
• 9

  Additional resources

  Some materials the Hexlet team have picked up. This will give you a more in-depth understanding of the topic