AVL Tree traversal postOrder

Question

I'm learning data structures, and I'm building an AVL tree class. I want to traverse the tree by saving the elements in one string. I already built the three functions that traverse over the tree in {inorder,preorder,postorder} recursively on the console. I wonder how I can modify the code to load the result into a string, and not the console.

I will post the code for postorder down here:

void printPostorder(Node root) { // prints the tree in post order     left right root
    if (root == null)
        return;
    printPostorder(root.left);
    printPostorder(root.right);
    System.out.print(root.element + " ");
}

The simplest (I don't say best) way would probably be, defining a string outside of the function and instead of printing to the console just appending to the string. — derpirscher, Jun 10 '22 at 16:44

score 0 · Answer 1 · edited Jun 11 '22 at 10:22

0

I don't know how you made your printPostorder or printPostorder but you could use a string builder

StringBuilder str = new StringBuilder();
// you might want to do this recursively or with a loop though
str.append(printPostorder(root.left).toString);
str.append(printPostorder(root.right).toString);

Also for something more interesting, see How to print binary tree diagram in Java?

edited Jun 11 '22 at 10:22

Mark Rotteveel

100,966
191
140
197

answered Jun 10 '22 at 18:20

Saheed

301
1
2
11

AVL Tree traversal postOrder

1 Answers1