need the code for the siftup function for binary tree

The SiftUp and SiftDown methods are responsible for fixing the partial ordering of the tree from its index parameter up to the root, or down to the leaves of the tree. For a max heap, the partial ordering property is that a node's value is equal or greater than the values ofits children