Binary Tree traversal

[Alec Sultana]

Hello and Happy new Year ^^

For my school assignment I built myself an AVL tree - it works as intended, however I need to represent the nodes and Data into Left-Data-Right representation, But I have no idea how to do it.

Left-Data-Right representation should be 3 columns. Left subtree's Data - current Node Data - Right subtree Data



Any suggestions would be appreciated

Thanks

[Campbell Ritchie]

Welcome to the Ranch

Do you mean an in‑order depth traversal? You don’t usually print that in columns, but the principles are easy:-

1: if left node is not null
     call method recursively on left node
2: print this node's value
3: if right node is not null
     call method recursively on right node

You can get different traversals by altering the order of parts 1 2 and 3