Question

Preorder traversal of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Can you find the post

order traversal of this tree? If so, list the post order traversal sequence. Will your tree be unique?​

Answer 1

Answer:

30, 20, 10, 15, 25, 23, 39, 35, 42

32 bit unsigned integers.you are required to give output a comma separated list,showing for each elements in the list the enteger you get by reversing bits in its binary representation.for example ,if list is 32 bit unsigned integers.you are required to give output a comma separated list,showing for each elements in the list the enteger you get by reversing bits in its binary representation.for example ,if list is 32768,101200 and 262144, you are expected to give as output 65536 ,18151952 and 8192. integers in the list will be given one per line and 262144, you are expected to give as output 65536 ,18151952 and 8192. integers in the list will be given one per line