We are going to be implementing a Binary Tree together! ๐
Since Trees are a data structure that relies on nodes, I like to think of a Binary Tree as a pre-sorted type of linked list. There is a little alorithmic logic to how a BST stores the data.
To get started head over to BinaryTree.py and check out the classes there. There are method stubs that we are going to fill out together!
...and a good order to study them in.
- Linked lists -- introduction to node based datas structures
- Binary Search Trees -- more complex algorithm for sorting in node based data structure
- Tries -- tree-like datastructure where one node can be related to an arbitrary amount of nodes
- Graphs -- any node can be linked to any other node in this data strucutre
gitbook:
https://gawdiseattle.gitbook.io/wdi/08-cs/cs-trees-data-structures
imbalanced binary tree:
https://appliedgo.net/balancedtree/
miro board:
https://miro.com/app/board/o9J_lWxUo_o=/
visualgo:
code along built from theses resources:
https://www.tutorialspoint.com/python_data_structure/python_binary_tree.html
https://www.geeksforgeeks.org/binary-tree-set-1-introduction/