What code is used to traverse a binary tree inorder?
Yes, the "BinaryTree", "AVLTree", and "RedBlackTree" data structures each support an "InOrderScan" operation.
"BinaryTree"
"AVLTree"
"RedBlackTree"
"InOrderScan"
TreeTraversalOrder -> "InOrder" will be added in the next release of the Wolfram Language. This was reviewed recently in a Stephen Wolfram Live CEOing livestream:
TreeTraversalOrder -> "InOrder"
Live CEOing Ep 773: Language Design in the Wolfram Language [LogPDF, Multi, and More]
In the Wolfram documentation I found this code which answered m question.
I went through the various TreeTraversal options. PreOrder and PostOrder are possible options but I do not find an InOrder option.
Maybe here can help.
Regards M.I.