Tentative steps. Today, I took some first tentative steps into understanding Hash tables:

This post is a culmination of previous project related posts. It’s useful for me to see the needs develop and to decide when and what to implement and how I can combine the requirements into clear actions to take.

Definition A binary search tree (BST) is a tree data structure in which nodes are arranged according to the following property.

Definition Level Order traversal is a breath first transversal. The traversal starts at the root and explores all the nodes at the same depth prior to moving onto the next depth level.

Tree Traversals (Preorder, Inorder and Postorder) From the root of a binary tree, traverse deeper before going laterally.

Binary Tree Terms A tree has a root and leaves.

Certificates Section Next mini-project here on this site is to start to put together a list of certificates and courses I’ve done.