Write a routine to list out the nodes of a binary tree

Assignment Help Computer Engineering

Reference no: EM132213282

Write a routine to list out the nodes of a binary tree in level-order. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on. You must do this in linear time. Prove your time bound.

Assume that what is meant by "list out" is that the method returns a java.util.List<Integer> containing the data from the tree in level order. Add a new method to your BinaryTree class named levelOrder(). You will need to maintain a data structure to help you control the traversal.

You should use something from java.util, but make a good choice that is well-suited to the task at hand. In the comment for levelOrder(), write a brief statement justifying your decision. Test thoroughly.

This is in Java.

Reference no: EM132213282

Questions Cloud

Write a remove method for an integer array : Write a "remove" method for an integer array. The method takes in two arguments, the array to remove the value from (oldArray), and a value to remove (value).

Retrieve a program to apply the method to several data sets : Write/retrieve a program to apply the method to several data sets, obtaining comparison counts and swap counts for shell sort in JAVA.

Compute morgans dependent tax credit : Morgan (age 45) is single and provides more than 50% of the support of Rosalyn (a family friend, age 36), Flo (a niece, age 18), and Jerold (a nephew, age 18).

Write a regular expression that describes the language : Write a regular expression that describes the following language: the set of strings that that contain an even number of a's.

Write a routine to list out the nodes of a binary tree : Write a routine to list out the nodes of a binary tree in level-order. List the root, then nodes at depth 1, followed by nodes at depth 2, and so on.

Write a recursive function that will take a nonnegative int : Write a recursive function that will take a nonnegative integer n as formal parameter and return its factorial. Trace the function calls for n = 4.

Simulate a simple four function calculator without a memory : Write a Ruby Script that simulates a simple four function calculator without a memory.

Write a regular expression to pass to grep to determine : Write a regular expression to pass to grep to determine if a Chicago area (773 or 312) phone number, in the form (312) 281-3303, is present in a given file.

Write a research about the importance of servers rooms : Write a research about the importance of servers rooms or (network devices rooms) in any organization or institutions.

User Account

All Pages