Advantage: constant level time complexity with better space utilization. The binary tree with the binary-search searching strategy has a time complexity O(logN

Advantage: constant level time complexity with better space utilization. The binary tree with the binary-search searching strategy has a time complexity O(logN), which is higher than htree's. This htree is mainly for memory bounded cases.