As shown in Figure 1, we regard Heap as a course concept due to its similar structure while Binary Search Tree is a prerequisite concept of Tango Tree.
mere context information is not enough for effective expansion.