Hey guys,
I am confused with complete binary search tree and heap data type. Are they the same?
Many Thanks
Paddy
Printable View
Hey guys,
I am confused with complete binary search tree and heap data type. Are they the same?
Many Thanks
Paddy
No, Binary search trees gaurentee that the left node > the node > the right node, while heaps guarantee that the main node > either child, but in no particular order. Also, heaps mix in indexing, too and enforce that the depth can only increase when the last depth was completely filled, while binary search trees can have any depth changes made dispite the current row being partially filled (of course, self balancing binary trees try to remedy this, but still does not fulfill the same roll as heaps).
Each type of data structure has different performance times, a quick peek over at wikipedia can give you the big-O notation for common operations with each data structure.
ah I see.Thanks a lot.