Tree implementation?

Question

How do I implement a tree? Including insertion and deletion. I've been googling it but I just couldn't find any example. Therefore I don't really understand how trees are built, by given pairs of connected node index.

Answer 1

Gordie Then how about indexes:
For example

5 2 (Left)
5 7 (Right)
2 1 (Left)
2 4 (Right)
7 6 (Left)
7 9 (Right)

Answer 2

Gordie Just like given the root node, and the child node, and whether it is a left node or right node.