HomeworkLib
Question

Define binary tree and Binary search tree. Insert 18, 62, 67, 90, 11, 98, 53, 4,...

Define binary tree and Binary search tree. Insert 18, 62, 67, 90, 11, 98, 53, 4, 51, 6, 79, 8, 9,10, 23, 45, 78, 21 in the BST. Write the algorithms for all the 3 operations of BST

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

A binary tree is a tree, where each node can have only 2 children maximum and each children can be of a binary tree type. There is no ordering in binary tree.

A binary search tree is a binary tree, where there is order in the numbers. A nodes value is higher than value of any node in its left subtree, while it will be lower than any node in the right subtree.

Insert elements into BST:
1. If start node is null, then add a new node with the new element.
2. Else if new element is less than root's value, then go to left child and again start from step 1.
2. Else if new element is more than root's value, then go to right child and again start from step 1.

0 0
Add a comment
Know the answer?
Add Answer to:
Define binary tree and Binary search tree. Insert 18, 62, 67, 90, 11, 98, 53, 4,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Insert the following values in the given order into a Binary Search Tree and use the...

    Insert the following values in the given order into a Binary Search Tree and use the resulting BST in the next 5 questions. 15 8 3 6 23 9 11 10 20 13 5 9. What is the height of the resulting Binary Search Tree? 10. What is the depth of the node that stores the value 11? 11. Is there a path from the node storing the value 15 to the node storing the value 5? If so, show...

  • 4. i) Give the difference between binary trees and Binary search trees. Insert the values 50,...

    4. i) Give the difference between binary trees and Binary search trees. Insert the values 50, 76, 21, 4, 32, 64, 15, 52, 14, 100, 2, 3, 70, 87, 80 in the BST [Show the steps]. Write the algorithm for all the 3 operations of BST ii) Insert the given items 16, 14, 10, 8, 7, 9, 3, 2, 4, l into the Min- Heap. [Show the steps]. Write the pseudocode for Insertion of items using the Min- Heap

  • Starting with an empty binary search tree, insert each of the following keys and rotate it...

    Starting with an empty binary search tree, insert each of the following keys and rotate it to the root in the specified order: 6   1   18   7   15 Starting with an empty red-black binary search tree, insert the following keys in order:: 12   5   23   9   19   2   21   18   7 Show the tree immediately after you insert each key, and after each time you deal with one of the book's cases 1, 2, or 3 (that is, if dealing with one case leads to another, show the additional case as a...

  • answer number 7 5. Draw the binary search tree that would result from inserting the following...

    answer number 7 5. Draw the binary search tree that would result from inserting the following numbers into an initially empty tree in the order given: 45, 37, 62, 67, 49, 51, 16, 8, 73, 71, 64, 65 6. Given the tree created in problem 5, draw the tree that would result if you deleted the 37 from the tree? 7. Given the tree created in problem 5, draw the tree that would result if you deleted the 62 from...

  • Suppose a binary tree data (in tiny written size) is stored in an array (A) as...

    Suppose a binary tree data (in tiny written size) is stored in an array (A) as given below and root is placed at “0”index. Note the array indices are in larger written size (0 to 74). Show the traversal data of the given tree for a)      In-Order Traversal b)     Post Order Traversal A 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 3 28 13 36 15 9 22 44 7 10 75 33 19 15...

  • in PYTHON   create a binary search tree that has the minimum possible height (i.e., is as balanced...

    in PYTHON   create a binary search tree that has the minimum possible height (i.e., is as balanced as possible). You're given the elements in sorted order. Here are some example inputs and the minimum possible height of the resulting BST: [0] 0 [-3, -2, -1] 1 [-3, 0, 1, 3, 4] 2 [-9, -6, -5, -3, -2, 1, 2, 4, 8] 3 [-19, -17, -15, -12, -11, -9, -7, -1, 1, 4, 5, 7, 8, 9, 11, 12, 13, 14, 18]...

  • Write a python nested for loop that prints out the following pattern 100 99 98 97...

    Write a python nested for loop that prints out the following pattern 100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33...

  • 3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw...

    3. (8 points) Using the implementation of binary search tree operations we discussed in class, draw the trees that result from the following operations: (a) Inserting 142, 400, 205, 127, 100, 320, 160, 141, and 110 into an initially-empty tree (in that order). (b) Deleting 142 from the tree you drew for part (a). 4. (8 points) Draw the unique binary tree that has a preorder traversal of 4, 1, 6, 3, 7, 5, 9, 2, 8 and an inorder...

  • Calculate the range, mean, mode, median, Standard deviation Calculate the skewness and kurtosis for the above...

    Calculate the range, mean, mode, median, Standard deviation Calculate the skewness and kurtosis for the above data and interpret the data. The following is data collected from the daily salary employees of ZZ COMPANY.. 68 19 43 11 37 30 19 67 65 34 96 23 93 73 46 39 21 12 89 52 33 21 18 57 80 56 91 62 56 48 84 23 78 96 49 36 90 42 65 15 43 36 65 59 34 71...

  • 6. For the B+-tree where M=3 and L=5 shown below, show how an insert of value...

    6. For the B+-tree where M=3 and L=5 shown below, show how an insert of value 80 is handled. || 12 || 50 || / | \ / | \ 2 12 50 5 18 65 7 20 70 9 21 72 10 24 78 10 points 7. For the B+-tree where M=3 and L=5 shown below, show how an insert of value 28 is handled. || 24 || 75 || / | \ / | \ / | \...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT