# 8 posts tagged with "binary search tree"

### 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…

### 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…