Can you make an alogorithm using only heapfunctions; heappush(), heappop() and len() to generate x length of numbers wich makes the input of a balanced binary tree witch is not self balancing?
It has to be in python
Anyone that knows if this is possible?