(Pre-order and post-order traversal). Implement the textbook's algorithm (not the Java implementation) for pre-order and post-order traversal. To "process" or "visit" a node means to print the data at that node.
Pre-order traversal output: 10 6 4 8 18 15 21
Post-order traversal output: 4 8 6 15 21 18 10
Additionally, create and traverse the following trees:
Homework Answers
Answer:
Preorder implementation:
display(root->data) preorder(root->left) preorder(root->right)
Postorder implementation:
postorder(root->left) postorder(root->right) display(root->data)
Traversal of given trees:
Preorder traversal of first tree:
1 -> 2 -> 4 -> 5 -> 3 -> 6 -> 7
Postorder traversal of first tree:
4 -> 5 -> 2 -> 6 -> 7 -> 3 -> 1
Preorder traversal of second tree:
Root -> edu -> unc -> med -> cs -> com -> google -> maps -> yahoo
Postorder traversal of second tree:
med -> cs -> unc -> edu -> maps -> google -> yahoo -> com -> Root
Please give thumbsup, if you like it. Thanks.
Add Answer to:
(Pre-order and post-order traversal). Implement the textbook's
algorithm (not the Java implementation) for
pre-order and post-order...
2. Write a recursive algorithm which computes the number of nodes in a general tree. 3....
2. Write a recursive algorithm which computes the number of nodes in a general tree. 3. Show a tree achieving the worst-case running time for algorithm depth. 4. Let T be a tree whose nodes store strings. Give an efficient algorithm that computes and prints, for every node v of T, the string stored at v and the height of the subtree rooted at v. Hin Consider 'decorating' the tree, and add a height field to each node (initialized to...
Could you please write the algorithms for In-order, Post-order and Level-order in this form as Pre-order...
Could you please write the algorithms for In-order, Post-order
and Level-order in this form as Pre-order is.
Thank you.
void preorder (BinNode rt) if (rt-null) return; // Empty subtree - do nothing visit(rt); preorder (rt.left()); // Process аїї nodes in ïeft preorder (rt.right // Process root node ()); // Process аїї nodes in right
In Java. How would this method look? LinkedBinaryTree.java import java.util.Iterator; public class LinkedBinaryTree implements BinaryTreeADT {...
In Java. How would this method look?
LinkedBinaryTree.java
import java.util.Iterator;
public class LinkedBinaryTree implements BinaryTreeADT {
private BinaryTreeNode root;
/**
* Creates an empty binary tree.
*/
public LinkedBinaryTree() {
root = null;
}
/**
* Creates a binary tree from an existing root.
*/
public LinkedBinaryTree(BinaryTreeNode root) {
this.root = root;
}
/**
* Creates a binary tree with the specified element...
Write a (void) method to traverse a binary tree in Breadth-First order, where you start from...
Write a (void) method to traverse a binary tree in Breadth-First order, where you start from the root, print the node values of its children, (left and then right) (these are at level 1), then print all node values at level 2 from left to right, and then level 3 etc. For the example binary tree below, you should get the result A, B, E, C, F, D, G, H. Notice that this type of traversal is not the same...
Question B1 You are given the following Java classes: public class Queue { private static class...
Question B1 You are given the following Java classes: public class Queue { private static class Node { Object object; Node next; Node () { object = null; next = null; } Node (Object object, Node next) { this.object = object; this.next = next; private Node header; private int size = 0; // size shows the no of elements in queue public Object dequeue () { if (size == 0 ) { return null; else { Object remove_object = header.object;...
Please I need help ASAP Java Programing: Binary Search Tree Fully implement the BST class in Listing 25.4 (on page 961 of the 11th Edition of the text). Design and write a (main) driver program to com...
Please I need help ASAP Java Programing: Binary Search Tree Fully implement the BST class in Listing 25.4 (on page 961 of the 11th Edition of the text). Design and write a (main) driver program to completely test every method in the BST class to ensure the class meets all its requirements. You should read the Listing 25.5: TestBST.java for an idea of what your program should look like. Listing 25.4 BST.java public class BST> extends AbstractTree { protected TreeNode...
TestCodeForAssigment.py def main(): # testing recursive find, pre- and post-order, and __len__ """ creating the following...
TestCodeForAssigment.py
def main():
# testing recursive find, pre- and post-order, and __len__
""" creating the following BST:
25
15 29
12 20 27 50
17 """
t1 = BST()
t1.insert_rec(25)
t1.insert_rec(15)
t1.insert_rec(12)
t1.insert_rec(20)
t1.insert_rec(17)
t1.insert_rec(29)
t1.insert_rec(27)
t1.insert_rec(50)
print("Let's see if we can find 27 using the non-recursive find: ", t1.find(27))
print("Let's see if we can find 27 using the recursive find: ", t1.findRecursive(27))
print("The length of the BST tree is ",t1.__len__())
print("The preorder traversal of the tree:", list(t1.preOrder()))
print("The postorder...
Using the following implementation of Tree class Node { public int iData; // data item (key) public...
Using the following implementation of Tree class Node { public int iData; // data item (key) public double dData; // data item public Node leftChild; // this node's left child public Node rightChild; // this node's right child public void displayNode() // display ourself { System.out.print('{'); System.out.print(iData); System.out.print(", "); System.out.print(dData); System.out.print("} "); } } // end class Node //------------------------------------------------------------------ import java.io.IOException; import java.util.Stack; public class Tree { private Node root; // first node of tree // ------------------------------------------------------------- public Tree() // constructor { root = null; }...
I am stuck on a data structure problem, I am just going off of Geeks for...
I am stuck on a data structure problem, I am just going off of Geeks for Geeks for help but I need to print 100 random numbers in the range of [1-200]. I can currently only print 5 numbers. Here is my code: #include <stdio.h> #include <stdlib.h> #include <limits.h> using namespace std; //binary tree has data & left and right child struct node{ int data; struct node *left; struct node *right; }; //create a new node struct node* newNode (int...
write a new test program called RemoveDuplicates.java. The program reads text input from keyboard or a text file and adds the words to a BST. The program then traverses the BST and prints out the word...
write a new test program called RemoveDuplicates.java. The program reads text input from keyboard or a text file and adds the words to a BST. The program then traverses the BST and prints out the words in order (based on ASCII/UNICODE order) on the screen (or to output text file). Note that you may need to make some changes to BST.java. Sample test: ----jGRASP exec: java -ea removeDuplicates Original Text: a B 2 n w C q K l 0...
2. Write a recursive algorithm which computes the number of nodes in a general tree. 3. Show a tree achieving the worst-case running time for algorithm depth. 4. Let T be a tree whose nodes store strings. Give an efficient algorithm that computes and prints, for every node v of T, the string stored at v and the height of the subtree rooted at v. Hin Consider 'decorating' the tree, and add a height field to each node (initialized to...
Could you please write the algorithms for In-order, Post-order
and Level-order in this form as Pre-order is.
Thank you.
void preorder (BinNode rt) if (rt-null) return; // Empty subtree - do nothing visit(rt); preorder (rt.left()); // Process аїї nodes in ïeft preorder (rt.right // Process root node ()); // Process аїї nodes in right
In Java. How would this method look?
LinkedBinaryTree.java
import java.util.Iterator;
public class LinkedBinaryTree implements BinaryTreeADT {
private BinaryTreeNode root;
/**
* Creates an empty binary tree.
*/
public LinkedBinaryTree() {
root = null;
}
/**
* Creates a binary tree from an existing root.
*/
public LinkedBinaryTree(BinaryTreeNode root) {
this.root = root;
}
/**
* Creates a binary tree with the specified element...
Question B1 You are given the following Java classes: public class Queue { private static class Node { Object object; Node next; Node () { object = null; next = null; } Node (Object object, Node next) { this.object = object; this.next = next; private Node header; private int size = 0; // size shows the no of elements in queue public Object dequeue () { if (size == 0 ) { return null; else { Object remove_object = header.object;...
TestCodeForAssigment.py
def main():
# testing recursive find, pre- and post-order, and __len__
""" creating the following BST:
25
15 29
12 20 27 50
17 """
t1 = BST()
t1.insert_rec(25)
t1.insert_rec(15)
t1.insert_rec(12)
t1.insert_rec(20)
t1.insert_rec(17)
t1.insert_rec(29)
t1.insert_rec(27)
t1.insert_rec(50)
print("Let's see if we can find 27 using the non-recursive find: ", t1.find(27))
print("Let's see if we can find 27 using the recursive find: ", t1.findRecursive(27))
print("The length of the BST tree is ",t1.__len__())
print("The preorder traversal of the tree:", list(t1.preOrder()))
print("The postorder...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago