Golang Binary Search Tree - Golang Data Structures

Golang Binary Search Tree - Golang Data Structures Today&Golang tutorial video is all about the Binary Search Tree in the Go programming language. We will go through the reasons why and how the Binary Search Tree is implemented in Go/Golang. So that you can fully understand the Data Structure in Go/Golang. Enjoy! -- Golang Dojo is all about becoming Golang Ninjas together. You can expect all kinds of Golang tutorials, news, tips & tricks, and my daily struggles as a Golang developer. Make sure to subscribe if you look forward to such content! -- Timestamps 0:00 Intro 1:12 What is it? 1:53 How it works? 5:02 Why use it? 6:27 Implementation in Golang 7:14 Node & BST Wrapper 8:34 Node & BST Wrapper in Codes 9:30 BST String (In Order Traversal) 11:41 BST String (In Order Traversal) in Codes 16:12 BST Add () 18:43 BST Add () in Codes 21:58 BST Search () 23:11 BST Search () in Code 26:00 BST Remove () 30:03 BST Remove () in Code 35:08 Extra -- #golangdojo