Construct a binary search tree for the following set of...

Transcript

00:01 Hello student first we have to create the binary search tree with the given keys so these keys are given to us and we have generated this binary search tree with the help of this so we know left is lesser than the root and right is greater than the root so by using this concept i create this binary tree now inorder traversal is like this first left then root and this is left this is root plus symbol and this is right so in this way we do the traversal so by using this here first left will become 10 so here after that root and after that 35 so in this way my tree is creating so here left smallest is here and the largest is after that preorder traversals so in the preorder traversals i have to use root first so here root first then its left is used that is 25 and after that 10 to the left of this and after that 40 and in this way 65 comes late last one and after that postorder traversal so in the postorder left is 10 and after that after 10 visiting then 30 will be come so here at the last 50 will become algorithm to delete a node in a singly linked list so we have to delete the node in a single linked list so linked list is like this way so if the head is null then return head and if the head is equal to target then return the head .next and current equal to head and if current .next is not null then if current .next data equals target then current .next equal to current .next .next so return the head here so in this way if head is so here different different scenario if head is null then return this return the head otherwise if head .data is equal to target then return head .next so here head .next will be returned and current will be head and otherwise file current .next is not null then follow this now algorithm for the binary search in the binary search as we know the list is already sorted so here array and the target value which we want to search so here left is equal to 0 and right is equal to length of array…

Question

Construct a binary search tree for the following set of numbers 34, 14, 39, 26, 45, 54, 46, 17, 7, 68 and then find its preorder traversal.

Question

Construct a binary search tree for the following set of numbers 34, 14, 39, 26, 45, 54, 46, 17, 7, 68 and then find its preorder traversal.

Please give Ace some feedback