Instructions

• Create a branch called technical-challenge were you will be adding all your work.
• Update readme with an Execution Instructions section explaining how to run/test you implementation.

Challenge

Binary Search Tree

A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. Each node contains a value and pointers to it's left and right children with the left child containing values less than the parent node and the right child containing values greater than the parent node.

Example:

                        5
                    /      \
                   3        12
                 /   \    /    \
                2     4  9      14
                        / \    /  \
                       8  11  13   19

Your task is to implement a Binary Search Tree (BST) supporting the following operations:

• Insertion (Maintaining the BST property)
• Searching
• Traversal (Inorder, Postorder and Preorder)

For the purposes of this exercise, ignore any duplicate insertions (if an element already exists on the tree, the insertion shouldn't be allowed).

Additional details

• You can resolve the challenge using the programming language of your preference.

• You have 1 hour to complete the challenge.

• After finishing, upload the changes in a Pull Request, assign it to yourself and ensure you request review from any of the invited collaborators to your repository.

Good luck :)