Program plan: item, root, d variableare used for input. There is structure Treenode havingdata, leftptr, rightptr member variables which represents the tree node. void insertnode(node **ptr, int value) function inserts the node in the tree and create a tree. void inorder(node ptr) function display the tree values in sorting order. int depth(node ptr) determine the height of depth of tree and return max depth between left or right nodes path. Program description: The main purpose of the program is to create binary search tree, display the tree values and measure and display the depth of the tree.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 12.19E

Program Plan Intro

Program plan:

item, root, d variableare used for input. There is structure Treenode havingdata, leftptr, rightptr member variables which represents the tree node.

void insertnode(node **ptr, int value) function inserts the node in the tree and create a tree.

void inorder(node ptr) function display the tree values in sorting order.

int depth(node ptr) determine the height of depth of tree and return max depth between left or right nodes path.

Program description:

The main purpose of the program is to create binary search tree, display the tree values and measure and display the depth of the tree.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(Python)- Implement functions successor and predecessor. These functions will take two arguments: the root of a tree and an integer. The successor function returns the smallest item in the tree that is greater than the given item. The predecessorfunction returns the largest item in the tree that is smaller than the given item. Both functions will return -1 if not found. Note that the predecessor or successor may exist even if the given item is not present in the tree. Use this template: # Node definition provided, please don't modify it.class TreeNode:def __init__(self, val=None):self.val = valself.left = Noneself.right = None# TODO: Please implement the following functions that return an integer# Return the largest value in the tree that is smaller than given value. Return -1 if not found.def predecessor(root, value):pass# Return the smallest value in the tree that is bigger than given value. Return -1 if not found.def successor(root, value):passif __name__ == "__main__":# TODO:…

Use function def showList(self) Precondition: None. Postcondition: Outputs the keys of the elements of the order list. If the list is empty, outputs “Empty list” note: Use python and the concept of doubly Linked List

(Java) How can I implement a binary search tree in a program to store data, and use the delete method to trim the tree? The program should have a 'populate' button that obtains a string from the user, creates a sorted binary search tree of characters, and prints the tree using the DisplayTree class. It should also print the characters on one line in sorted order by traversing the tree in inorder fashion. The program should also have a 'Trim Tree' button that obtains a second line of input to delete characters from the tree, trimming the tree accordingly. It should ignore characters that are not in the tree, and only delete one character for each occurrence in the second line of input. When all characters from the second line have been deleted from the tree, the program should print the remaining characters in the tree using the DisplayTree class. The output should be labeled appropriately, and no spaces or commas should be used between tree elements in the inorder traversal.Here is the…