We will start coding OCT-Tree (It’s no ordinary OCT-tree ok). Our OCT-tree is super optimized to accommodate other objects that are from out of the bounds. Also they can handle objects that go out of their scope. For handling dynamic objects they have specialized backtracking features. For faster inter-node collision check they have a special indexer attached with them. Finally our OCT-Tree have the ability to make a insertion at any node ( rather than at the root node ) it will re-adjust itself according to the convection’s we have set before.