The result of inserting keys 1 to $$2^k -1$$ for any $$k>4$$ in

The result of inserting keys 1 to $$2^k -1$$ for any $$k>4$$ in order into an initially empty skew heap is always a full binary tree. ~@[](2)

答案：TRUE