algorithm - Triary-Heap-Ordered Tree -

I have a laboratory where I ordered a triangular heap of code given for binary piled-ordered trees Edited trees need to be edited. (This is all in Java)

My idea for this is ...

With the binary tree, you simplify the comparison of left and right children.

For a trilogy tree, it seems that you should compare the middle child with the left child, then in the middle of the child in the right child ... is this right?

Now important question .. I did not remember the algorithm tree for a triangular heap order ... I believe for a binary tree, its

  parents = "Child - 1/2"   
 So it will not be triary just ...?  
  parent = "child - 1/3"