# Blog Posts

### heap review

The current list of ADTs and data structures ar ebelow. Adding heaps finishes the…

### buildheap algorithm

The buildheap algorithm constructs a heap in linear time. This is an improvement…

### heap operations

#### 06/29/2021 22:55 | Category: dsa

##### Tags: heapbinary_heap

Add and remove operations for heaps are in logarithmic time, which are quite…

### binary heaps

#### 06/29/2021 22:07 | Category: dsa

##### Tags: heapbinary_heap

Binary heaps are the most common form of heap structure. There are more types; however…

### formalizing my docker notes

I'm finding that I would like a centralized place for my notes on using…

### randomness in computing

#### 06/24/2021 11:52 | Category: dsa

##### Tags: randomness

Randomness is a concept to model real-world phenomena like a coin flip or…

### skiplists

The skiplist is a similar data structure to the BST, in that it solves a searching problem…

### removing from a bst

#### 06/23/2021 16:18 | Category: dsa

##### Tags: binary_search_treetrees

The removal method from a BST is one of the hardest operations to implement…

### adding to a bst

#### 06/23/2021 11:09 | Category: dsa

##### Tags: binary_search_treetrees

Adding to a BST has similarities to searching; however, if we need to restructure…

### searching in a bst

#### 06/23/2021 09:54 | Category: dsa

##### Tags: binary_search_treetrees

Linear data structures have O(n) time complexity for searching for data. Binary…

### trees review

The Tree ADT worked through the Binary Tree ADT and BST ADT. The current data…

### unique binary tree using traversal combos

#### 06/22/2021 19:38 | Category: dsa

##### Tags: binary_treetreesrecursion

When working through creation of unique binary tree…

### traversal review in trees

#### 06/22/2021 18:56 | Category: dsa

##### Tags: traversalrecursionbinary_search_treebinary_treetrees

Different traversals offer pros and cons when working with BSTs, depending…

### breadth iterative traversals

#### 06/22/2021 18:43 | Category: dsa

##### Tags: binary_search_treetreestraversal

Levelorder traversal gets all data in the order that it appears within…

### depth recursive traversals

#### 06/20/2021 13:12 | Category: dsa

##### Tags: binary_search_treetreesrecursion

Each binary search tree traversal is a variation of some recursive…

### how many BSTs from n elements

#### 06/20/2021 12:43 | Category: dsa

##### Tags: binary_search_treetreesmath

When determining the number of BSTs that can be formed from "n…

### binary search tree

#### 06/19/2021 17:59 | Category: dsa

##### Tags: binary_search_treetreesnon-linear_models

(bst) A type of binary tree with the same properties but enforce a data order…

### binary trees bst

#### 06/19/2021 17:15 | Category: dsa

##### Tags: binary_treestreesnon-linear_models

Binary trees are a tree that has a shape restriction, nodes can have at most two…

### tree structures

#### 06/19/2021 16:43 | Category: dsa

##### Tags: treesnon-linear_models

Trees are a gateway concept toward efficient search procedures. Previous structures…

### gatsbyjs graphql zet changes

When working through how I'll be deploying my Zets to my website I…