Question

how binary
search tree stored in the memory​

Answer 1

Answer:

HERE IS THE ANSWER

Explanation:

et our tree T is a binary tree that us complete binary tree. Then there is an efficient way of representing T in the memory called the sequential representation or array representation of T. ... If a node occupies TREE [k] then its left child is stored in TREE [2 * k] and its right child is stored into TREE [2 * k + 1].