A. Write 3n − (k + 5) in prefix notation: ????.
b. If T is a binary tree with 100 vertices, its minimum height is ????.
c. Every full binary tree with 50 leaves has ???? vertices.

Solution Summary

Write in prefix notation, find minimum height of a binary tree, find number of vertices in a binary tree.

Use C++ language to do this exercise, BST (Binary Search Trees) template in attach files.
Write a program that manage your phonebook contact using BST
It helps to find easily and rapidly the phone number of your friend based on the name and inverse . Contact can be saved in text file. User can read contact already saved in t

My goal, given two binarytrees, is to return true if they are structurally identical, meaning they are made of nodes with the same values arranged in the same way.
Each line of values in input file "tree2Data.txt" represents one linear binary tree, where ' _ ' represents a no value node.
Compare all trees to all other tre

# Recall that a binary tree can be defined recursively as:
* A Binary Tree is either empty
* or A Binary Tree consists of a node with a left and right child both of which are BinaryTrees.
The degree of a node in a tree is equal to 0 if both children are empty, 1 if one of the children are empty, and 2 of both children ar

AVL trees are a good implementation of binary search trees. Show (step by step) the AVL trees formed by inserting the numbers 3, 11, 2, 9, 8, 12, 10, 5, 4, 7, 6, 1, 13.

The program in the attachment uses an ordered linked list. Summary report menu selection shows all books in sorted alphabetical order and report by year menu displays books in ascending order by publish year. Keep this format, but modify the program to make it use binary tree instead of ordered linked list. You may use more than

-----------
Show that if binary tree T is full at level i, then it is full at every level j smaller than i.
---------------
Show that the depth of the complete binary tree Tn for a general n is given by
D(Tn) = [log2n].
See attached for better format.
------------
Using induction, give a direct proof of Propo

10.30.
Use the integers from one to nine to build a nine-node binary search tree with no duplicate data values
(a). Give the possible root node values if the depth of the tree is 4.
(b). Answer part (a) for depths of 5, 6, 7, and 8.

Assume that we are transmitting binary digits over a binary erasure channel which is shown in the following figure, where transmitted digits may be erased. An erasure occurs with probability ? for both inputs symbols. Let p(x = 0) = p and p(x =1) = 1- p. Determine the channel matrix.