Register

trees in data structure

549 views
1 votes
1 votes
Q-We are given set of n distinct elements and an unlabled binary tree with  n nodes how many ways we can populate the tree with given set so that it becomes binary search tree ?
User Avatar

1 Answer

0 votes
0 votes
1 way..

perform in order traversal of that unlabeled tree...as the nodes are traversed, assign them with elements in increasing order(since BST inorder is ascending)...
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
once_2019 asked Jun 24, 2018
631 views
trees data structure
Is the root node an internal node?
Is the root node an internal node?
User Avatar
0 votes
0 votes
3 answers
2
smartmeet asked Feb 8, 2017
6,986 views
Data Structure In-Order Predecessor
If a node in a BST has two children, then its in-order predecessor has a) No left child b) No right child c) 2 children d) no child
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
User Avatar
–4 votes
–4 votes
2 answers
3
Souvik33 asked Oct 27, 2022
636 views
Data Structure- Tree & Graphs
*MSQ* The following figure depicts a a. A tree and only tree b. A tree with 3 nodes c. A graph (Since every tree is a graph) d. A graph and only graph
*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
User Avatar
1 votes
1 votes
1 answer
4
rahul sharma 5 asked Apr 12, 2018
695 views
BST Data Structure
a:) If given Tree is BST => Inorder of keys is sorted b:) Inorder of keys is sorted => Tree is BST(converse of above) I know first one holds.Is second one also true?If not can someone give counter example?
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...
User Avatar
Link Copied!