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.2CP
Program Plan Intro

Postorder traversal:

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

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

Algorithm:

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

Node postorder(Node bTree)

{

    //Check tree is not empty

    if (tree != null)

    {

        //Print value of left subtree

        postorder(bTree.left);

        //Print value of right subtree

        postorder(bTree.right);

        //Print the root node value

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

    }

}

Blurred answer