In order traversal sequence of the resultant tree is 0 1 2 3 4 5 6 7 8 9.
<h3>What is tree transversal?</h3>
In this traversal method, the left subtree is visited first, then the root and later the right sub-tree. We should always remember that every node may represent a subtree itself.
If a binary tree is traversed in-order, the output will produce sorted key values in an ascending order.
Given:
7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree.
In order traversal:
In this traversal method, the left subtree is visited first, then the root and later the right sub-tree. We should always remember that every node may represent a subtree itself.
If a binary tree is traversed in-order, the output will produce sorted key values in an ascending order.
So, the sequence, 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in the order at the initially empty binary tree. And the binary search tree uses the usual ordering on natural numbers.
As, In-order traversal of a Binary search tree gives elements in increasing order.
Hence, the order of the elements in in order traversal is 0,1,2,3,4,5,6,7,8,9.
Learn more about in order traversal here:
brainly.com/question/12947940
#SPJ4
, where c is the hypotenuse (the longest side, in this case 53).