Hey guys,
I am confused with complete binary search tree and heap data type. Are they the same?
Many Thanks
Paddy
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
LinkBack URL
About LinkBacks
About heap data type
Hey guys,
I am confused with complete binary search tree and heap data type. Are they the same?
Many Thanks
Paddy
Related threads:
Re: About heap data type
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.
Re: About heap data type
ah I see.Thanks a lot.
Reply With Quote