recategorized by
189 views

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
rahul sharma 5 asked Apr 12, 2018
667 views
a:) If given Tree is BST = Inorder of keys is sortedb:) Inorder of keys is sorted = Tree is BST(converse of above)I know first one holds.Is second one also true?If not ca...
–4 votes
–4 votes
2 answers
2
Souvik33 asked Oct 27, 2022
603 views
*MSQ*The following figure depicts a a. A tree and only treeb. A tree with 3 nodesc. A graph (Since every tree is a graph)d. A graph and only graph
0 votes
0 votes
1 answer
3
once_2019 asked Jun 24, 2018
612 views
Is the root node an internal node?
0 votes
0 votes
3 answers
4
smartmeet asked Feb 8, 2017
6,896 views
If a node in a BST has two children, then its in-order predecessor hasa) No left childb) No right childc) 2 childrend) no child