? Preorder Postorder Inorder Breadth-first

Insert the value "8" into the following Red-Black tree; draw the result.Use Double-circle to denote red nodes and single circle to denote black nodes.

What is the maximum number of leaves a tree with n > 2 nodes can have? And what is the minimum number?

Please help! If possible, please include explanation so I understand why the answer is what it is.

We have built a family tree, and each node in the family tree represents a person. We'd like to know how many members of the family are currently living in the house. Please write down the algorithm.

construct a binary search tree using a set of numbers, similar to the example mentioned in the class. after constructing the BST, you need to give the pre-order traversal of the tree. Finally, you’re required to remove the root of tree. Please show me step by step how to do this!

Please answer the question in the screenshot. Please give a detailed explanation.

Read the tree from simple.dnd file and after coloring each branch with a different color write these two trees in tree.phy file.

When presenting a menu option to the user in the main cpp file. Asking user to input in an ID, how do I code a search method implementation where it takes that ID and search it in the binary tree and either return true if found and false if not. I am trying to steer away from using item which is attached to both (ID, username). I am trying to only take the ID input and the node pointer and traversing through the binary tree to find if the ID matches any of the nodes.

Please, use Java and write a clear answer to your own work and I'll rate up. Thank you :)