GoLang Tutorial - Binary Search Tree (BST) - Part 1 (Tree/Node structs with insert and print functions)

bogotobogo.com site search:
Binary Search Tree (BST)
We'll use the following Binary Search Tree (BST):

Here is the basic code : creating a Tree and a Node structs including inserting a key to the tree:


This code is available : bst-basic.go
Print functions - Tree Traversal


Pre Order: F B A D C E G I H
func printPreOrder(n *Node) { if n == nil { return } else { fmt.Printf("%d ", n.data) printPreOrder(n.left) printPreOrder(n.right) } }
Post Order: A C E D B H I G F
func printPostOrder(n *Node) { if n == nil { return } else { printPostOrder(n.left) printPostOrder(n.right) fmt.Printf("%c ", n.data) } }
In Order: A B C D E F G H I
func printPostOrder(n *Node) { if n == nil { return } else { printPostOrder(n.left) printPostOrder(n.right) fmt.Printf("%c ", n.data) } }


This code is available : bts-print.go

Go Tutorial
- GoLang Tutorial - HelloWorld
- Calling code in an external package & go.mod / go.sum files
- Workspaces
- Workspaces II
- Visual Studio Code
- Data Types and Variables
- byte and rune
- Packages
- Functions
- Arrays and Slices
- A function taking and returning a slice
- Conditionals
- Loops
- Maps
- Range
- Pointers
- Closures and Anonymous Functions
- Structs and receiver methods
- Value or Pointer Receivers
- Interfaces
- Web Application Part 0 (Introduction)
- Web Application Part 1 (Basic)
- Web Application Part 2 (Using net/http)
- Web Application Part 3 (Adding "edit" capability)
- Web Application Part 4 (Handling non-existent pages and saving pages)
- Web Application Part 5 (Error handling and template caching)
- Web Application Part 6 (Validating the title with a regular expression)
- Web Application Part 7 (Function Literals and Closures)
- Building Docker image and deploying Go application to a Kubernetes cluster (minikube)
- Serverless Framework (Serverless Application Model-SAM)
- Serverless Web API with AWS Lambda
- Arrays vs Slices with an array left rotation sample
- Variadic Functions
- Goroutines
- Channels ("<-")
- Channels ("<-") with Select
- Channels ("<-") with worker pools
- Defer
- GoLang Panic and Recover
- String Formatting
- JSON
- SQLite
- Modules 0: Using External Go Modules from GitHub
- Modules 1 (Creating a new module)
- Modules 2 (Adding Dependencies)
- AWS SDK for Go (S3 listing)
- Linked List
- Binary Search Tree (BST) Part 1 (Tree/Node structs with insert and print functions)
- Go Application Authentication I (BasicAuth, Bearer-Token-Based Authentication)
- Go Application Authentication II (JWT Authentication)
Ph.D. / Golden Gate Ave, San Francisco / Seoul National Univ / Carnegie Mellon / UC Berkeley / DevOps / Deep Learning / Visualization