Question: Given a Binary Search Tree, when the root is traversed first, it is called: Pre order in order post order
Given a Binary Search Tree, when the root is traversed first, it is called:
Pre order
in order
post order
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
