Question

Binary trees can be used to implement a sorting method. 1. Extend the package BinaryTree.m from Section 6.3 by a function InOrder[tree $]$. The function should return all records of the tree in a list in the following order: first, the elements of the left subtree (recursively); then, the element at the root; finally, the elements of the right subtree. Because of the ordering of the binary tree, the resulting list will be sorted. 2. Use InOrder[tree] to implement a sorting function TreeSort [list] that sorts the list by first inserting all its elements into a binary tree and then converting the tree back into a list.

   Binary trees can be used to implement a sorting method.
1. Extend the package BinaryTree.m from Section 6.3 by a function InOrder[tree $]$. The function should return all records of the tree in a list in the following order: first, the elements of the left subtree (recursively); then, the element at the root; finally, the elements of the right subtree. Because of the ordering of the binary tree, the resulting list will be sorted.
2. Use InOrder[tree] to implement a sorting function TreeSort [list] that sorts the list by first inserting all its elements into a binary tree and then converting the tree back into a list.

Computer science with Mathematica: theory and practice for science, mathematics, and engineering

Roman Maeder 1st Edition

Chapter 6, Problem 2

Instant Answer

Step 1

m package** - First, you need to create a function `InOrder[tree_]` that traverses a binary tree in an in-order manner. This means the function should first recursively visit all nodes in the left subtree, then the root node, and finally all nodes in the right Show more…

Show all steps

Thanks for your feedback!

Binary trees can be used to implement a sorting method. 1. Extend the package BinaryTree.m from Section 6.3 by a function InOrder[tree $]$. The function should return all records of the tree in a list in the following order: first, the elements of the left subtree (recursively); then, the element at the root; finally, the elements of the right subtree. Because of the ordering of the binary tree, the resulting list will be sorted. 2. Use InOrder[tree] to implement a sorting function TreeSort [list] that sorts the list by first inserting all its elements into a binary tree and then converting the tree back into a list.

Play audio

Feedback

Ace is your personal tutor. It breaks down any question with clear steps so you can learn.

Start Using Ace

Continue solving this problem

Create a free account to:

View full step-by-step solution
Ask follow-up questions with Ace AI
Save progress and study later

Please give Ace some feedback