Notice: This page requires JavaScript to function properly.
Please enable JavaScript in your browser settings or update your browser.
Binary Tree | Trees Part I
Data Structure & Algorithms PART I
course content

Conteúdo do Curso

Data Structure & Algorithms PART I

Data Structure & Algorithms PART I

1. Introduction to ADS
2. Data Structures Part I
3. Trees Part I
4. Trees Part II

Binary Tree

Trees can be binary and non-binary.

We think trees may be hard to implement if you are a beginner in programming.

So, we are going to implement in Python only 2 types of Trees: the BST, and the AVL, as they are one of the most popular ones.

With other types of trees, we will 'make friends' briefly.

In nearest future, when you are ready to study other types of trees, we will do that!

Let’s go! Trees are waiting for us!

A Binary Tree is a tree that has at most 2 children. The structure of each node is not complicated. Every node has:

  • Data inside it;
  • Left child pointer;
  • Right child pointer.
12345
class TreeNode(object): def __init__(self, val): self.val = val self.left = None self.right = None
copy

It is like you can point and your children, but they may exist or not. Frequently speaking, computer programming families look weirdo, isn’t it?)

What statement is wrong?

Selecione a resposta correta

Tudo estava claro?

Seção 3. Capítulo 2
We're sorry to hear that something went wrong. What happened?
some-alt