rastkocvetkovic
Programmer
I've programmed a c++ heap structure (left-balanced binary tree) using array. Now I'm searching for the best algorithm to search element that is in this array.
I'm aware that HEAP uses minimal space as a binary tree (no pointers). Now I have a question on practical usage of it - where is it used or could be used?
Thanks for answers in advance, Rastko
I'm aware that HEAP uses minimal space as a binary tree (no pointers). Now I have a question on practical usage of it - where is it used or could be used?
Thanks for answers in advance, Rastko