Binary Search Tree in Go

[tech-geek29]

Fixes #2199

Checklist:

• 4 space indentation.
• Coding conventions are followed.
• Input is taken dynamically.
• Sample Input / Output is added at the end of file.
• Logic Documentation (Comments).
• File names are correct.

Make sure these boxes are checked before your pull request (PR) is ready to be reviewed and merged. Thanks!

Changes proposed in this pull request:

• Added the Go implementation for Binary Search Trees
• Also added few other examples of 1-D Arrays in Go

Languages Used:

• Go

Files Added:

• Binary_Search_Trees/go/BinarySearchTree.go
• 1-D_Array/Go/code/EvenOdd.go
• 1-D_Array/Go/code/FrequencyOfAnElement.go
• 1-D_Array/Go/main.go

We're happy to help you get this ready -- don't be afraid to ask for help.

Thanks!

[tech-geek29]

Hi @jainaman224 Can you please review and merge the above Fix?