I’m continuing my learning of the Binary Search Trees, so this post contains notes that I took on Traversals in the Binary Search Tree.

BST are beneficial when you need to access and process large amounts of ordered data very quickly, at the expense of some memory overhead.

Depth First…

I’m continuing my learning of the Binary Search Trees, so this post contains notes that I took on Height in the Binary Search Tree.

Height of a Tree: Is the longest path from our root node to it’s farthest node, the leaf node.

It’s like counting all the edges from…

I’m continuing my learning of the Binary Search Trees, so this post contains notes that I took on DELETION in the Binary Search Tree.

Looking at some cases in deleting a node from the Binary Search Tree.

Case 1: Deleting a node with no children.

Case 2: Deleting a node…

With my on-going study of algorithms and data structures, I’m continuing to the next data structure, Binary Trees.

This is what I’ve learned so far about Binary Trees.

Finding data within a binary search tree is typically pretty quick, as well as insertion and deletion.

— — — — —…

In my on-going journey to have a better understanding of algorithms, I am continuing to learn about Linked Listed.

This is what I have learned this week about Linked Lists.

What is a node?

A node has two properties

1. data

2. next

— — — — — — —…

Josh Raiborde

Hello, I am a young enthusiastic Software Engineer. Looking forward to an opportunity to use my skills for mutual benefits and growth as well.

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store