Computer Science, asked by amolkaleak143, 3 months ago

The post-order traversal of a binary tree
is O P Q R S T. Then possible pre-order
traversal will be​

Answers

Answered by kalashpatel168
0

Answer:

dbjjdbjsvxhsvhzehdhsvhevsbehbcjsgnfkakalrtjskkeibdjsidjdbfid

Explanation:

dhdbdbhjdidhhadbfxkfhriagivhHDsdhubbdidfhisvjavjaf

Similar questions