Which of the following is FALSE about Binary Search Tree (BST)? Select one: A.Stores keys in the nodes in a way so that searching, insertion and deletion can be done efficiently B.From the root and go left as long as there is a left child will yield the smallest element C.BST property states that all the keys in a left subtree are smaller and all in a right subtree are larger than a particular key. D.Pre-order traversal will print out all the keys in sorted order

Which of the following is FALSE about Binary Search Tree (BST)? Select one: A.Stores keys in the nodes in a way so that searching, insertion and deletion can be done efficiently B.From the root and go left as long as there is a left child will yield the smallest element C.BST property states that all the keys in a left subtree are smaller and all in a right subtree are larger than a particular key. D.Pre-order traversal will print out all the keys in sorted order

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

Similar questions

Which of the following statements about Binary Search Tree (BST) is FALSE? Choose one:A.Organizes keys in nodes in such a manner that searching, insertion, and deletion are efficient.B.Start at the root and work your way left as long as there is a left child. This will result in the smallest element.The C.BST attribute specifies that all keys in a left subtree are smaller than a certain key, whereas all keys in a right subtree are bigger.D.Pre-order traversal prints out all the keys in alphabetical order.
Create a binary search tree using the following insertions. 55, 44, 66, 99, 88, 22, 77, 33, 25, 75 Based on the final tree, what is the preorder traversal of the tree? (Ensure that there is A SPACE between each number)
Create a binary search tree using the following insertions. 55, 44, 66, 99, 88, 22, 77, 33, 25, 75 Based on the final tree, what is the postorder traversal of the tree? (Ensure that there is A SPACE between each number)
Which of the following is not true about binary search trees?a)A binary search tree can not be empty.b)For a node "n" in a a binary search tree, n's value greater than all values in its left subtree.c)A binary search tree is a binary tree that is sorted according to the values in its nodes.d)All nodes within a binary search tree are binary search trees.
Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the postorder traversal of the tree?
Which of the following statements are correct for a binary search tree?a) The root always contains the largest key.b) All keys in the left subtree are always smaller than any key in the corresponding right subtree.c) All leaves are located on the same level.d) Each subtree is also a binary search tree.
Create a binary search tree using the following insertions. 55, 44, 66, 99, 88, 22, 77, 33, 25, 75 Based on the final tree, what is the inorder traversal of the tree?
Which of the following statements is true about AVL Trees? A. The difference between the heights of left and right nodes cannot be more than 1. B. The height of an AVL Tree always remains of the order of O(logn) C. AVL Trees are a type of self-balancing Binary Search Trees. D. All of the above.
Draw the AVL tree after performing each of the following operations consecutively on an initially empty binary search tree: insert 8, insert 6, insert 12, insert 3, insert 10, insert 9, delete 12, delete 8, insert 7, insert 8. If you delete an item from an AVL tree and then insert it back into the tree, will you always get back the original AVL tree? Justify your answer.
Perform what is asked. Show your solutions.1. Given the expression A - B / C * (D + E), convert to PREFIX and POSTFIX.2. Given the expression (A / B) ^ C * D, convert to PREFIX and POSTFIX. 3. Given the expression A || B && !C || !D, convert to PREFIX and POSTFIX. 4. Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the preorder traversal of the tree?5. Create a binary search tree using the following insertions.44, 88, 55, 77, 33, 99, 66, 22, 25, 75Based on the final tree, what is the postorder traversal of the tree?
Q2. a. What is a Binary Search Tree? b. Draw the Binary Search Tree that results from the insertion, one at a time, of nodes with Keys 27, 59, 21, 38, 54, 63, 8, 70, 15, 12. (Marking Scheme: Each correct insertion in the tree will give you c. Perform the following operations on the original tree and redraw the tree after each operation ) i.deleting 63 ii.deleting 59 iii.Insert 65 iv.Insert 22 d. Write down the inorder, preorder and postorder traversal on the constructed binary tree.
How many of the following statements are true about Binary Search Tree (BST): Select one of the following:Searches, inserts, and deletes keys in the nodes quickly and efficiently.The smallest element may be found by starting at the root and working your way left as long as there is a left child.Right and left subtrees are both smaller than one specific key, according to C.BST property.Print all keys in sort order using the D.Pre-order traversal