Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
Starting Out with Java: From Control Structures through Data Structures (4th Edition) (What's New in Computer Science)
4th Edition
ISBN: 9780134787961
Author: Tony Gaddis, Godfrey Muganda
Publisher: PEARSON
Question
Book Icon
Chapter 21.1, Problem 21.3CP
Program Plan Intro

Preorder traversal:

It process all the nodes of the tree in the following order.

  • First, traverse the root node.
  • Then, traverse all the nodes in the left subtree.
  • Finally, traverse all the nodes in the right subtree.

Algorithm:

Method “preorder” to print the values stored in a binary tree is as follows:

Node preorder(Node bTree)

{

    //Check tree is not empty

    if (tree != null)

    {

        //Print the root node value

        System.out.print(bTree.value + " ");

        //Print value of left subtree

        preorder(bTree.left);

        //Print value of right subtree

        preorder(bTree.right);

    }

}

Blurred answer
Students have asked these similar questions
Suppose an array is given A = [A, C, E, F, K, L, M, N, Y, Z]   a.  Draw a complete TERNARY tree from array A.b.  Write preorder and postorder traversal for the created complete ternary.c.   Draw the adjacency matrix and adjacency list for the complete ternary tree/graph. [You must consider the tree direction from top to bottom when drawing adjacencymatrix and list]
What problems do you encounter when you try to define the concept of an inorder traversal for ternary trees?
Draw a single tree whose inorder traversal is and whose postorder traversal is f, a, g, b, h, d, i, c, j, e f.g, a, h, i, d. j, e, c, b
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education