GATE CSE 2015 | Set 3 | Question: 13

Question

While inserting the elements $71, 65, 84, 69, 67, 83$ in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is

• A. $65$
• B. $67$
• C. $69$
• D. $83$

Comments

did it right being easy, I was trying to find a way to do such questions by making sense of if they are the smallest or they are the largest but that is very wrong way of doing such questions (self note )

---

Lowest level must be root at level 0,

why considering in reverse

---

@js__ by lowest element here they meant lowest position can also be said as element farthest from the root 

I think they want to convey the position-wise lowest not numeric lowest

Answer 1

On last level $67$, hence option $B$ is True.

Answer 2

The Constructed Binary Search Tree from the given Elements will be

Clearly, the element in the lowest level in the above BST is 67. So, Option B is True.

Answer 3

option B.... 67 because  it is on level 3 and 83 is on level2

Answer 4

B. 67 is true.

Element 67 will be on level 3 i.e., last level of this tree.

Answer 5

B. 67 (At Level 3)

Answer 6

First elelment is root then insert elements as
1.smaller elements then node should be on Left Subtree of that node this is true for every node.
2.Larger elements then node should be on Right Subtree of that node this is true for every node.


Courtesy: GeekForGeeks
Insert(Root,key)
{
    if(Root is NULL)
        Create a Node with value as key and return
    Else if(Root.key >= key)
        Insert(Root.left,key)
    Else
        Insert(Root.right,key)
}