Implement Tree data structure

[Shubhayu-Das]

Do the checklist before filing the issue:

• [x] Do you have Node.js and all the relevant dev-dependencies installed?
• [ ] Is this a bug fix?
• [ ] Is this an enhancement?
• [x] Is this a feature request?

NOTE: Provide a clear and concise description of the feature that needs to be added! Or if its a bug, then provide the necessary steps to reproduce it along with screenshots.

• Give your answer below:

---

Tree data structure is widely used in competitive programming owing to it's nature of reducing O(n) problems to O(log n) problems. I suggest we implement a data structure names BinaryTree, which can be further built up on in the future.

We can can further implement Binary Search Trees, Balanced Binary Search Trees, Segment Trees etc in the future, using this basic Binary Tree implementation.

The Binary Tree will have the following functions:

1. insert(data)
2. remove(data)
3. search(data)
4. inorder()
5. preorder()
6. postorder()
7. findMin(node)
8. findMax(node)
9. update(data, new_val)

[Shubhayu-Das]

I would like to work on this if you accept the issue.

[fave77]

@sateslayer you're assigned.

[Shubhayu-Das]

I've have some doubts regarding the validation which I'm supposed to provide:

1. How do I check whether a node actually exists in the tree or not? - In a binary tree this is simply a matter of going left or right. Here there might be unknown number of nodes which makes traversal much harder

This is why I thought of changing this issue to the implementation to only binary trees instead of generic trees. This would be much easier to implement and useful too in programming. Raw trees are hardly ever used; implementing binary trees using a generic tree code is very troublesome

Waiting for your reply so that I can proceed accordingly.

[fave77]

Okay, make it a binary tree!

[Shubhayu-Das]

I'll make the requisite changes in the issue above?

[fave77]

okay