The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
437 views
When searching for the key value 50 in a binary search tree, node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to node containing the value 50 are ________.
asked in DS by Loyal (7.8k points)
retagged by | 437 views

1 Answer

+4 votes
Best answer

$\frac{8!}{3!.5!} = 56.$

Ref: https://gateoverflow.in/3462/gate2007-it_29

answered by Veteran (358k points)
selected by


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

39,715 questions
46,750 answers
140,560 comments
58,402 users