public
T inOrder
(
BSTNode node,
int
steps
)
{
if
(
steps
==
0
)
{
return
node.
data
;
}
else
if
(
node
!=
null
&&
steps
!=
0
)
{
inOrder
(
node.
left
, steps
--
)
;
inOrder
(
node.
right
, steps
--
)
;
}
return
null
;
}