Table of Contents
Which of the following is not an application of binary search trees?
Which of the following is not an application of binary search? Explanation: In Binary search, the elements in the list should be sorted. It is applicable only for ordered list. Hence Binary search in unordered list is not an application.
Which of the following is not an application of trees?
Which of the following is not an advantage of trees? Explanation: Undo/Redo operations in a notepad is an application of stack. Hierarchical structure, Faster search, Router algorithms are advantages of trees. 7.
Can a binary search tree have duplicate?
In a Binary Search Tree (BST), all keys in left subtree of a key must be smaller and all keys in right subtree must be greater. So a Binary Search Tree by definition has distinct keys and duplicates in binary search tree are not allowed.
Which of the following is not a limitation of binary search?
Which of the following is not a limitation of binary search algorithm?
| 1) | a. must use a sorted array |
|---|---|
| 2) | b. requirement of sorted array is expensive when a lot of insertion and deletions are needed |
| 3) | c. there must be a mechanism to access middle element directly |
Which of the following is not required condition for binary search algorithm Mcq?
| Q. | Which of the following is not the required condition for binary search algorithm |
|---|---|
| B. | the list must be sorted |
| C. | there should be the direct access to the middle element in any sublist |
| D. | none of the above |
| Answer» a. there must be mechanism to delete and/ or insert elements in list |
What are the applications of tree?
The following are the applications of trees:
- Storing naturally hierarchical data: Trees are used to store the data in the hierarchical structure.
- Organize data: It is used to organize data for efficient insertion, deletion and searching.
- Trie: It is a special kind of tree that is used to store the dictionary.
Which of these is not a binary tree?
Discussion Forum
| Que. | Which of the following need not to be a binary tree? |
|---|---|
| b. | B-Tree |
| c. | AVL-Tree |
| d. | Search tree |
| Answer:B-Tree |
What is strict binary tree?
A strictly binary tree with n leaves always contains 2n -1 nodes. If every non-leaf node in a binary tree has nonempty left and right subtrees, the tree is termed a strictly binary tree. Or, to put it another way, all of the nodes in a strictly binary tree are of degree zero or two, never degree one.
How to allow duplicates in a binary search tree?
So a Binary Search Tree by definition has distinct keys. How to allow duplicates where every insertion inserts one more key with a value and every deletion deletes one occurrence? A Simple Solution is to allow same keys on right side (we could also choose left side).
What is the best way to count numbers in binary search tree?
A Better Solution is to augment every tree node to store count together with regular fields like key, left and right pointers. Insertion of keys 12, 10, 20, 9, 11, 10, 12, 12 in an empty Binary Search Tree would create following. This approach has following advantages over above simple approach.
How to allow same keys on same side of binary search?
A Simple Solution is to allow same keys on right side (we could also choose left side). For example consider insertion of keys 12, 10, 20, 9, 11, 10, 12, 12 in an empty Binary Search Tree
Why we can’t insert any new node anywhere in binary search tree?
We can’t insert any new node anywhere in a binary search tree because the tree after the insertion of the new node must follow the binary search tree property. To insert an element, we first search for that element and if the element is not found, then we insert it.