Write a recursive algorithm, Computer Engineering

Assignment Help:

Write a recursive algorithm to count the number of right children in a binary search tree.

Write the method levelCount whose header is given below. Method levelCount returns the number of nodes on the specified level.

int BinarySearchTree :: levelCount(BinaryNode* t, int level);

1770_Write a recursive algorithm.png

For this problem, the root is at level zero, the root's children are at level one, and for any node N its level is one more than N's parent's level. For example, for the bean-tree diagrammed below, the call levelCount(t,1) should return 2 (chickpea and navy are on level 1); the call levelCount(t,2) should return 3; and the call levelCount(t,4) should return 0.

Hint: when the level is 0, there is always just one node at that level, the root node (assuming it isn't empty), so return 1. If the level isn't zero, recursive calls will be used to determine the number of nodes at the requested level, and the level-requested should change in the recursive calls.


Related Discussions:- Write a recursive algorithm

Find the responses when a computer broadcast an arp reqqest, How many respo...

How many responses does a computer expect to receive when it broadcast an ARP request? Why? An ARP (Address Resolution Protocol) request message is put in a hardware frame and

Displaying the list of files with dir, Q. Displaying the List of Files with...

Q. Displaying the List of Files with DIR? You can display the list of files kept in a diskette or hard disk with the DIR commend. This Commends list files and sub directories i

How to set a read or write watch point for a variable, By using Rwatch, Awa...

By using Rwatch, Awatch command in GDB we can set read or write watchpoint for a variable.

Explain fixed point representation, Q. Explain Fixed Point Representation? ...

Q. Explain Fixed Point Representation? The fixed-point numbers in binary has a sign bit. A positive number has a sign bit 0 whereas negative number has a sign bit 1. In fixed-p

Difference between static call and dynamic call, In the case of Static call...

In the case of Static call, the called program is a stand-alone program, it is an executable program. During run time we can call it in our called program. As about Dynamic call, t

Design 4 to 1 multiplexer with strobe input using nand gates, Design a 4 : ...

Design a 4 : 1 multiplexer with strobe input using NAND gates. Ans. Design of 4 : 1 multiplexer with strobe input using NAND gates.

Explain fundamental instruction set characteristics, Q. Explain fundamental...

Q. Explain fundamental instruction set characteristics? Let's look into a number of fundamental instruction set characteristics: The operands can be addressed in memory,

Explain use of parallel sections construct, Q. Explain use of parallel sect...

Q. Explain use of parallel sections construct? This illustration explains use of parallel sections construct. Three functions, fun1, fun2, and fun3, all can be executed simulta

Database, I got a graduate level database assignment which is due at Dec 8,...

I got a graduate level database assignment which is due at Dec 8, 11:59p.m. Can you finish it on time in high quality?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd