Purchase Solution

Binary tree pre and post order traversals in Java

Not what you're looking for?

Ask Custom Question

Write a Java program that loads 12 random integers with the values between 1 and 100 into a tree. Apart from building the tree
- List the values that have been inserted.
- Print the tree out in preorder traversal order and then again in postorder traversal order.
- Print another line showing how deep the tree has become.

Purchase this Solution
Solution Summary

You will need to rename the attached program as BinaryTree.java before you compile and run it.

Purchase this Solution
Free BrainMass Quizzes
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.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

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.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

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.

View More Free Quizzes
Related BrainMass Solutions

  • Preorder and Postorder traversals of a tree

    So, postorder traversal of given tree will visit the vertices in order given below : 14,15,9,16,17,10,5,2,6,3,7,11,12,13,8,4,1 Solution gives the pre and post order traversals of given tree along with a brief explanation on how these traversals are

  • Problems about binary search tree in Java

    6578 Problems about binary search tree in Java Questions: a. Consider the following binary search tree: (Please see the figure in attached problem file) i. What tree results after you insert the nodes 44, 48, 32, 36, 38, and 49 in that order?

  • Binary tree: preorder, postorder and inorder scan

    269389 Binary tree: pre-order, post-order and in-order scan (a). Draw the binary tree that the following allocations create.

  • Binary Tree Data Structure Questions using C++ and STL

    The result is: 50, 25, 80, 20, 35, 70, 90, 15, 23, 30, 45, 65, 75, 100, 5, 18, 68, 95, 150 This solution provides detailed answers to several questions related to a binary tree. This includes tree inserts, deletes, and various tree traversals.

  • Java program to parse an arithmetic expression

    566292 Java program to parse an arithmetic expression Write a Java program that takes as input an infix arithmetic expression then transforms it to a postfix expression and based on a binary tree, it evaluates that expression.

  • Java Binary Search Tree Solution

    I modified Student.java for tree purpose. The expert examines Java binary search tree solutions.

  • C++ Binary Tree to handle single word data

    Traverse (in-order, pre-order, post-order) - label tree output with traversal order used to print the tree. Attached is the input file. The commands should be executed in the order given.

  • ADT table in Java

    In ordered vector, you may need to move every record left and in binary search tree you may need to move half of the records left). ADT table in Java is included.

  • Java List Arrays Example: Class SList

    public class SList { // Methods public void insert(int item); // Pre: The list is not full // item is not in the list // Post: item is in the list; the items are in sorted order public void printList() // Post: If the list is not empty

View More Related Solutions