Tree PostOrder Traversal#10060

Tree PostOrder Traversal

1 Sekunde

128 Megabyte

Leicht

Implement a PostOrder traversal of a tree.

In this traversal, the left subtree is visited first, then the right subtree, and finally the root node.

Definition of a tree:

// Java
class TreeNode {
  public:
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode(int x) {
      val = x;
      left = NULL; 
      right = NULL;
    }
};

// C++
class TreeNode {
  public:
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

Implement the function PostOrder that prints in one line the vertices of the tree in order of PostOrder traversal. Separate the vertices with one space.

// Java
void PostOrder(TreeNode tree)

// C++
void PostOrder(TreeNode *tree)

Beispiele

During the PostOrder traversal, the vertices will be printed in the following order: 1 3 2 9 16 10 4.