Chapter 25, Problem 25.11PE

Program Plan Intro

Display Tree

Program Plan:

• Include the required import statement.
• Define the main class.
  • Declare the necessary variables
  • Using start initialize the required.
    • Create an object for “BST” class.
    • Create border pane, tree view, text field and button.
    • Set the tree view as center, alignment.
    • Add an action even to the button.
    • Create a scene and place the pane in the stage.
    • Set the title.
    • Place the scene in the stage.
    • Display the stage.
  • Define the main method using public static main.
    • Initialize the call.
  • Define “TreeView” class.
    • Declare the required variables.
    • Define the constructor.
    • Define the “setStatus” method.
      • Add the value.
    • Define the “displayTree” method.
      • Clear the pane
      • Display the tree recursively.
  • Define the “displayTree” method.
    • Check if the left node value is not equal to null.
      • Draw a line to the up node.
      • Draw the left subtree recursively.
    • Check if the right node value is not equal to null.
      • Draw a line to the down node.
      • Draw the left subtree recursively.
    • Display the node.
  • Define the “BST” class.
    • Declare the required variables.
    • Create a default BST class.
    • Create a binary tree from an array of objects.
    • The “height” method will return the height of the tree.
    • Define the “search” method.
      • Start the traverse from the root of the tree.
      • If the search element is in the left subtree set that value in “current” variable otherwise set the “current” variable as right subtree value.
    • Define the “insert” method.
      • If the root is null create the tree otherwise insert the value into left or right subtree.
    • Define the “createNewNode”
      • Return the result of new node creations.
    • Define the “inorder”
      • Inorder traverse from the root.
    • Define the protected “inorder” method
      • Traverse the tree according to the inorder traversal concept.
    • Define the “postorder”
      • Postorder traverse from the root.
    • Define the protected “postorder” method
      • Traverse the tree according to the postorder traversal concept.
    • Define the “preorder”
      • Preorder traverse from the root.
    • Define the protected “preorder” method
      • Traverse the tree according to the preorder traversal concept.
    • Define the “TreeNode” class
      • Declare the required variables.
      • Define the constructor.
    • Define the “getSize” method.
      • Return the size.
    • Define the “getRoot” method
      • Return the root.
    • Define the “java.util.ArrayList” method.
      • Create an object for the array list.
      • If the “current” is not equal to null, add the value to the list.
      • If the “current” is less than 0, set the “current” as left subtree element otherwise set the “current” as right subtree element.
      • Return the list.
    • Define the “delete” method.
      • If the “current” is not equal to null, add the value to the list.
      • If the “current” is less than 0, delete the “current” as left subtree element otherwise delete the “current” as right subtree element.
      • Return the list.
    • Define the “iterator” method.
      • Call the “inorderIterator” and return the value.
    • Define the “inorderIterator”
      • Create an object for that method and return the value
    • Define the “inorderIterator” class.
      • Declare the variables.
      • Define the constructor.
        • Call the “inorder” method.
      • Define the “inorder” method.
        • Call the inner “inorder” method with the argument.
      • Define the TreeNode “inorder” method.
        • If the root value is null return the value, otherwise add the value into the list.
      • Define the “hasNext” method
        • If the “current” value is less than size of the list return true otherwise return false.
      • Define the “next” method
        • Return the list.
      • Define the “remove” method.
        • Call the delete method.
        • Clear the list then call the “inorder” method.
    • Define the “clear” method
      • Set the values to the variables
  • Define the interface.
    • Declare the required methods.
    • Define the required methods.