https://www.youtube.com/watch?v=GzJoqJO1zdI

• Trees are well-known as a non-linear data structure. They don’t store data in a linear way. They organize data hierarchically.
• They are nodebased datastructures.
• Each node can only have between 0-2 children
• It is represented in the properties of the node with the properties .left and .right

The node of the top (3) is called the root of the tree

When you reach a node with no children, you call the node a leaf

All the nodes in between the root and the leaf node are called a branch

Traversal Order? (it depends)

You can choose to go traverse through a tree by either

• Iteratively (while and on pointer)
• recursively (call stack)

Branching Recursion: Since every node have more than 1 child(multiple children) you can have multiple recursive calls. It will be in the same shape of our tree.

Binary Search Tree

Like the binary search algo that uses a list or array, if a tree is balanced (in a list or array, sorted) give us a O(logn) search operation.

Requirements:

• Max 2 children