Computer Science, asked by shrutikandage, 2 months ago

Construct the binary tree whose preorder and inorder traversals are given:

PreOrder – 9, 6, 10, 8, 2, 13, 3, 5, 12, 4

InOrder – 10, 6, 2, 8, 3, 13, 9, 5, 4, 12

Write the post-order and level-order traversals of the tree

What is the heigth of this tree?

Is it full?

Is it complete?

Which node has the maximum depth?

Answers

Answered by Anonymous
0

Answer:

hi

Explanation:

aao jaldi come-girl-join-meet.muw-jgva-wzs

Similar questions