When searching for the key value 60 in a binary search tree, nodes containing…

PYQ GATE 2007

When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60?

  1. A.

    35

  2. B.

    64

  3. C.

    128

  4. D.

    5040

Attempted by 315 students.

Sign up free to check your answer

Sign up free

Explore the full course: Data Structures

Loading lesson…