WRITE IN C++ Enter integers through the keyboard. While entering the numbers, create a binary search tree. For a NULL node enter -1. For the created binary tree write its preorder, inorder, postorder and level order traversals. Then, ask the user to insert a value of a node in the tree. Write a function to find the predecessor of the given node (its value and address).

If the node is not found, the function should return NULL. If the found node is the root, the function should return NULL, as well. If the first value that is entered is equal to -1, then don't print the tree, its traversals or the predecessor of the given node, but instead only print a message that the tree is empty.

Example output:

 

Transcribed Image Text:

Enter the value for the root (-1 for empty tree): 5 Enter the next element to enter in the binary search tree <-1 for end): 2 Enter the next element to enter in the binary search tree <-1 for end): 1 Enter the next element to enter in the binary search tree <-1 for end): 3 Enter the next element to enter in the binary search tree (-1 for end): 8 Enter the next element to enter in the binary search tree <-1 for end): 6. Enter the next element to enter in the binary search tree (-1 for end): ? Enter the next element to enter in the binary search tree <-1 for end): 9 Enter the next element to enter in the binary search tree (-1 for end): -1 5 (0x782950) 12 (0x782968) 1 <0x782980) NULL NULL 13 (0x782998) NULL NULL 18 <0x7829b0> 16 <0x7829c8) NULL 117 (0x7829e0) NULL ||||NULL 119 (0x7829f8> NULL ¦¦¦NULL Preorder: Inorder: Postorder: 5 2 1 3 8 6 79 1 2 3 5 6 7 8 9 1 3 2 7 6 9 85 Level order: 5 2 8 1 3 6 9 7 Enter the element whose predecessor has to be found: 3 The predecessor of the element 3 is the element 2 located on address 0x782968 Process returned 0 (0x0> execution time: 15.644 s Press any key to continue. Enter the value for the root (-1 for empty tree): 5 Enter the next element to enter in the binary search tree <-1 for end): 2 Enter the next element to enter in the binary search tree <-1 for end): 1 Enter the next element to enter in the binary search tree <-1 for end): 3 Enter the next element to enter in the binary search tree (-1 for end): 8 Enter the next element to enter in the binary search tree <-1 for end): 6. Enter the next element to enter in the binary search tree (-1 for end): ? Enter the next element to enter in the binary search tree <-1 for end): 9 Enter the next element to enter in the binary search tree (-1 for end): -1 5 (0x782950) 12 (0x782968) 1 <0x782980) NULL NULL 13 (0x782998) NULL NULL 18 <0x7829b0> 16 <0x7829c8) NULL 117 (0x7829e0) NULL ||||NULL 119 (0x7829f8> NULL ¦¦¦NULL Preorder: Inorder: Postorder: 5 2 1 3 8 6 79 1 2 3 5 6 7 8 9 1 3 2 7 6 9 85 Level order: 5 2 8 1 3 6 9 7 Enter the element whose predecessor has to be found: 3 The predecessor of the element 3 is the element 2 located on address 0x782968 Process returned 0 (0x0> execution time: 15.644 s Press any key to continue.

Answer rating: 100% (QA)

include include struct Node int data Node left Node right Nodeint value datavalue leftnullptr rightnullptr Node insertIntoBSTNode root int value if ro... View the full answer