The basic Data structure to be used is tree.
- create a class node ,which will have arraylist for children and set parent to null,(genesis node) APPROACH
- create a class node ,which will have arraylist for children and set parent to null,(genesis node)
- THHE CHILDREN AND PARENT CAN BE SET USING FUNCTIONS 3.Childnode will feature there parents
- each object will have a uniqe encryption with its hash code
- verify using hashcode
- functions too edit value 7.arraylist for recording the ownership
- chain will fing the depth to leaf
- longest chain using the logic of diameter for tree 10.merge operation includes changes in parent node and changes down the parent