retagged by
5,794 views

2 Answers

0 votes
0 votes

Given that it is Binary search tree but note that it doesn't said it is balanced.

So, First insertion element is ROOT, in the left sub tree of ROOT, we have all elements which are less than ROOT.

Given Sequence of insertion is 60,25,72,15,30,68,101,13,18,47,70,34,

∴ in the inserting elements 25,15,30,13,18,47,34 are less than 60 and 72,68,101,70 are grater than 60.

No.of Nodes in the left subtree of ROOT = number of nodes less than ROOT = 7.

Answer:

Related questions

0 votes
0 votes
1 answer
2
Arjun asked Jan 2, 2019
17,065 views
Consider the following postfix expression with single digit operands :$6 \; 2 \: 3 \: ^* \: / \: 4 \: 2 \: ^* \; + \: 6 \: 8 \: ^* \: -$The top two elements of the stack...
1 votes
1 votes
2 answers
3
Arjun asked Jan 2, 2019
2,844 views
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list?$O(n ...
0 votes
0 votes
1 answer
4
go_editor asked Mar 27, 2020
294 views
Which traversal techniques lists the nodes of a binary search tree in ascending order?post – orderin – orderpre – orderlinear – order