Introduction to Java Programming 10th ed --25-4 (Implement preorder t.docx
Download as DOCX, PDF0 likes16 views
The document provides instructions on implementing a preorder traversal of a binary search tree (BST) without using recursion, utilizing a stack. It includes a code example in Java, showing how to create a method that takes user input for integers, stores them in a BST, and invokes the preorder traversal method to display the elements. The solution leverages a queue and a helper method to push all left nodes onto the queue for traversal.
1 of 1
Download to read offline
More Related Content
Similar to Introduction to Java Programming 10th ed --25-4 (Implement preorder t.docx (20)
Ad
More from diegor62 (20)
Ad
Introduction to Java Programming 10th ed --25-4 (Implement preorder t.docx
- 1. Introduction to Java Programming 10th ed **25.4 ( Implement preorder traversal without using recursion ) Implement the preorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the preorder method to display the elements. Solution package info.codeaddict.blog.tree.binary; import java.util.LinkedList; import java.util.Queue; /** * @author codeaddict.info */ public class PreOrderWithoutRecursion implements Traversal { @Override public void traverse(BinaryTree.Node root) { Queue queue = new LinkedList<>(); pushAllLeft(queue, root); while (!queue.isEmpty()) { BinaryTree.Node node = queue.poll(); System.out.println(node.value()); pushAllLeft(queue, node.right()); } } private void pushAllLeft(Queue queue, BinaryTree.Node node) { while (node != null) { queue.add(node); node = node.left(); } } }