Lära Binary Tree | Trees Part I

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:


              12345
            
class TreeNode(object):
  def __init__(self, val):
    self.val = val
    self.left = None
    self.right = None

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?)

Var allt tydligt?

Tack för dina kommentarer!

Avsnitt 3. Kapitel 2

Fråga AI

Fråga vad du vill eller prova någon av de föreslagna frågorna för att starta vårt samtal

Suggested prompts:

Ställ mig frågor om detta ämne

Sammanfatta detta kapitel

Visa verkliga exempel

Svep för att visa menyn