Btree Binary Tree data structure realization. Operations under Binary Tree(insert, search, delete) require on average O(n) actions. Optimally O(log(n)).