180 views

1 Answer

1 votes
1 votes

given that it is binary tree but not binary search tree...

in binary tree, you should know in-order with combination of either pre-order or post-order. Because one can not distinguish it is left or right sub tree by seeing only pre-order or post-order.

but in binary search tree you can always distinguish which node belongs to left sub tree and which is belongs right sub tree...

by the information given above... You can conclude option D is correct.

Related questions

0 votes
0 votes
2 answers
2
0 votes
0 votes
1 answer
4
Aniket1710 asked Jul 11, 2023
331 views
What is the time complexity of best algorithm that decides whether a given directedgraph represented as adjacency Matrix contains a sink or not ?(a)O(V^2)(b)O(VlogV)(c)O(...