Purchase Solution

Heaps, Binary Files and Bit Sets

Not what you're looking for?

Ask Custom Question

A complete binary tree B, containing 50 nodes, is stored in a vector.

(a). What is the level of the tree?
(b). How many nodes are leaf nodes? Nonleaf nodes?
(c). What is the index of the parent of B[35]?
(d). What are the indices of the children of node B[20]?
(e). What is the index of the first node with no children? With one child?
(f). What are the indices for all nodes at level 4 in the tree?

Purchase this Solution
Solution Summary

Heaps, binary files and bit sets are examined.

Solution Preview

The binary tree is as follows.
Level 1: B[0]
Level 2: B[1], B[2]
Level 3: B[3], B[4], B[5], B[6]
Level 4: B[7], B[8], B[9], B[10], B[11], B[12], B[13], B[14]
Level 5: B[15], ..., B[30]
Level 6: B[31], ..., ...

Purchase this Solution
Free BrainMass Quizzes
Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Basic Networking Questions

This quiz consists of some basic networking questions.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

C# variables and classes

This quiz contains questions about C# classes and variables.

View More Free Quizzes
Related BrainMass Solutions

  • Array-Based Tree, Heaps, Binary Files and Bit Sets

    Array-based tree, heaps, binary files and bit sets are examined.

  • Heaps, Binary Files and Bit Sets

    270722 Heaps, Binary Files and Bit Sets Draw the complete tree corresponding to each of the following vectors: (a). int a[8] = (15, 9, 3, 6, 2, 1, 4, 7) int aSize = sizeof(a)/sizeof(int); vector v(a, a + aSize); (b).

  • Merging Sorted Lists Using Heaps

    We need here to recall only the following 3 properties of heaps: - A Heap is a nearly complete binary tree and, given k items, they can be arranged into a Heap in a O(k log k ) time.

  • Data Types

    (Answer in decimal and binary) Answer: Considering sign-and-magnitude, the most significant bit will become the sign bit and the rest of the 6 bits are for the numerical value.

  • Encoder

    R1 R0 Selected range of window values 0 0 16 0 1 15-17 1 0 14-18 1 1 13-19 Compile and simulate your results. Give both AHDL and simulation results. Please see attached files for the solution to the given problems.

  • 16-bit 1's complement

    One's complement of a binary number is obtained by inverting all the bits (that is, swapping 1's for 0's and vice versa) in the binary number. So, 16-bit 1's complement of decimal value 1000 would be 11111100 00010111 (binary).

  • 8-bit 2's complement conversion

    258136 8-bit 2's complement conversion - What is the largest positive number one can repent in an 8-bit 2's complement code ? write your result in binary and decimal.

  • Multiplexer Conversion

    Eg. 1 - 0001, 2 - 0010, A - 1010 and so on. Remember that 'A' is number 10 in decimal system.

  • Binary Conversion to Decimal/Hex

    (11011001)base2 = D8 The expert converts the 6-bit unsigned binary numbers shown below to decimal forms.

View More Related Solutions