It looks like you're new here. If you want to get involved, click one of these buttons!

- 140.9K All Categories
- 104.4K Programming Languages
- 6.4K Assembler Developer
- 1.8K Basic
- 39.8K C and C++
- 4.2K C#
- 7.9K Delphi and Kylix
- 4 Haskell
- 9.6K Java
- 4.1K Pascal
- 1.3K Perl
- 1.9K PHP
- 507 Python
- 48 Ruby
- 4.3K VB.NET
- 1.6K VBA
- 20.8K Visual Basic
- 2.6K Game programming
- 310 Console programming
- 88 DirectX Game dev
- 1 Minecraft
- 110 Newbie Game Programmers
- 2 Oculus Rift
- 8.9K Applications
- 1.8K Computer Graphics
- 726 Computer Hardware
- 3.4K Database & SQL
- 521 Electronics development
- 1.6K Matlab
- 627 Sound & Music
- 256 XML Development
- 3.3K Classifieds
- 194 Co-operative Projects
- 181 For sale
- 189 FreeLance Software City
- 1.9K Jobs Available
- 600 Jobs Wanted
- 201 Wanted
- 2.9K Microsoft .NET
- 1.7K ASP.NET
- 1.1K .NET General
- 3.1K Miscellaneous
- 3 Join the Team
- 0 User Profiles
- 349 Comments on this site
- 59 Computer Emulators
- 1.9K General programming
- 178 New programming languages
- 596 Off topic board
- 160 Mobile & Wireless
- 34 Android
- 124 Palm Pilot
- 335 Multimedia
- 151 Demo programming
- 184 MP3 programming
- 0 Bash scripts
- 18 Cloud Computing
- 52 FreeBSD
- 1.7K LINUX programming
- 367 MS-DOS
- 0 Shell scripting
- 320 Windows CE & Pocket PC
- 4.1K Windows programming
- 882 Software Development
- 405 Algorithms
- 68 Object Orientation
- 86 Project Management
- 88 Quality & Testing
- 234 Security
- 7.5K WEB-Development
- 1.8K Active Server Pages
- 61 AJAX
- 2 Bootstrap Themes
- 55 CGI Development
- 19 ColdFusion
- 222 Flash development
- 1.4K HTML & WEB-Design
- 1.4K Internet Development
- 2.2K JavaScript
- 33 JQuery
- 285 WEB Servers
- 130 WEB-Services / SOAP

frozenparata
Posts: **33**Member

in C and C++

Hi guyz,

we know tht heap is a specialized tree-based data structure.I wish to know the answer for this qn.Let A and B be the nodes of a heap such tht B is a child of A.Heap must then satisfy the following condition.(heap property) key(A)>=key(B)

a)How many different heaps are there containing the three keys 1,2 & 3?

b)which positions cud be occupied by the 3rd largest key in a heap with 32 keys ?(where the root is counted as depth 0)

c)which positions cud be occupied by the 3rd smallest key in the heap with 32 keys??

plz help me in answering this by explanation.

we know tht heap is a specialized tree-based data structure.I wish to know the answer for this qn.Let A and B be the nodes of a heap such tht B is a child of A.Heap must then satisfy the following condition.(heap property) key(A)>=key(B)

a)How many different heaps are there containing the three keys 1,2 & 3?

b)which positions cud be occupied by the 3rd largest key in a heap with 32 keys ?(where the root is counted as depth 0)

c)which positions cud be occupied by the 3rd smallest key in the heap with 32 keys??

plz help me in answering this by explanation.

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.

## Comments

621Member: we know tht heap is a specialized tree-based data structure.I wish to know the answer for this qn.Let A and B be the nodes of a heap such tht B is a child of A.Heap must then satisfy the following condition.(heap property) key(A)>=key(B)

:

: a)How many different heaps are there containing the three keys 1,2 & 3?

:

: b)which positions cud be occupied by the 3rd largest key in a heap with 32 keys ?(where the root is counted as depth 0)

:

: c)which positions cud be occupied by the 3rd smallest key in the heap with 32 keys??

:

: plz help me in answering this by explanation.

:

Homework?

Greets,

Eric Goldstein

www.gvh-maatwerk.nl