Answered: 1. Where would a new node 18 be…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

100%

1. Where would a new node 18 be inserted?

a. 12's right child

b. 11's right child

Expert Solution

Step 1: Explanation

In a binary search tree, the elements are inserted by the strategy of keeping lesser elements in the left side and higher elements in the right side.
In other words, a Binary Search Tree (BST) has left sub-tree of a node has a key less than or equal to its parent node's key and right sub-tree of a node has a key greater than to its parent node's key.
As “18” is smaller than “20”, it will go to “12”, as “18” is greater than “12” it will be inserted to “12's right child”.

Step by step

Solved in 2 steps

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions