Also, the concepts behind a binary search tree are explained in the post Binary Search Tree. Algorithms usually traverse a tree or recursively call themselves on one child of just … Search A Binary (Max) Heap is a complete binary tree that maintains the Max Heap property. GitHub Gist: instantly share code, notes, and snippets. Here, we will focus on the parts related to the binary search tree like inserting a node, deleting a node, searching, etc. Binary Heap is one possible data structure to model an efficient Priority Queue (PQ) Abstract Data Type (ADT). Binary Tree Visualization. The making of a node and traversals are explained in the post Binary Tree in Java: Traversals, Finding Height of Node.