heaps are used for number of different things for onethey are used to implement priority queues there is also very efficient sorting algorithmcalled heap sortthat uses heaps we are going to study these in depth in subsequent summary in this we have looked at tree structures and some example uses of them we studied binary trees in particularwhich is subtype of trees where each node has at most two children we looked at how binary tree can be used as searchable data structure with bst we saw thatin most casesfinding data in bst is faster than in linked listalthough this is not the case if the data is inserted sequentiallyunless of course the tree is balanced the breadthand depth-first search traversal modes were also implemented using queue recursion we also looked at how binary tree can be used to represent an arithmetic or boolean expression we built up an expression tree to represent an arithmetic expression we showed how to use stack to parse an expression written in rpnbuild up the expression treeand finally traverse it to get the result of the arithmetic expression finallywe mentioned heapsa specialization of tree structure we have tried to at least lay down the theoretical foundation for the heap in this so that we can go on to implement heaps for different purposes in upcoming