question in heap(data structures)

[ofiri5]

hello
i learn data structure in university in israel and i get this question:
Given a Minimum-Heap H with n elements, implemented by a binary Tree (NOT by an array), so that each element in the tree holds only two pointers, one to its left child in the tree and the other to its right child. Thus, elements do not hold pointers to their parent in the tree. Notice that H is represented by a complete binary tree.(the h is O(log n))
i need to:
1)Suggest an O(log n) algorithm for finding the i'th element in the above ordering (i.e., Ai).
2)b) Show how to implement insert algorithm in O(log n)
thank you very much for helping
ofir

[ofiri5]

i forget to add that:
Let {A1, A2, …, An} be the ordering of nodes in H by layers (i.e., for each i < j, either (node) Ai is in a smaller layer than (node) Aj or they are both in the same layer and Ai is to the left of Aj)

[BioPhysEngr]

What progress have you made thus far?

[nuzzle]

i learn data structure in university in israel

Then you're getting a top-notch education but it's going to be difficult and you'll never survive on your own. I suggest you team up with a class mate asap.

Here's something,

http://en.wikipedia.org/wiki/Binary_heap