// CMPS390 // BinaryTree.java // Compelte 6 methods: getHeight, getNumberOfNodes, preorder, postorder, inorder, levelord

[answerhappygod]

Cmps390 Binarytree Java Compelte 6 Methods Getheight Getnumberofnodes Preorder Postorder Inorder Levelord 1 (62.9 KiB) Viewed 95 times

Cmps390 Binarytree Java Compelte 6 Methods Getheight Getnumberofnodes Preorder Postorder Inorder Levelord 2 (71.97 KiB) Viewed 95 times

Cmps390 Binarytree Java Compelte 6 Methods Getheight Getnumberofnodes Preorder Postorder Inorder Levelord 3 (84.39 KiB) Viewed 95 times

// CMPS390 // BinaryTree.java // Compelte 6 methods: getHeight, getNumberOfNodes, preorder, postorder, inorder, levelorder public class BinaryTree ( private BinaryNode root; public BinaryTree () { root = null; 1 // end default constructor public BinaryTree (Object rootData) root new BinaryNode (rootData); } // end constructor public BinaryTree (Object rootData, BinaryTree leftTree, BinaryTree rightTree) ( setTree (rootData, leftTree, rightTree); ) // end constructor public void setTree (Object rootData) root new BinaryNode (rootData); } // end setTree public void setTree (Object rootData, BinaryTree leftTree, BinaryTree rightTree) root new BinaryNode (rootData); if ((leftTree - null) && !leftTree.isEmpty()) root.setloftChild (leftTree.root); if ((rightTree != null) && frightTree.isEmpty()) { if (rightTree !- laftTree) root.setRightChild (rightTree.root); root.setRightChild (rightTree.root.copy()); } // and if if ((leftTree != null) && (this ! leftTree)) leftTree.clear(); if ((rightTree != null) & (this! rightTree)) rightTree.clear(); ) // end setTree else public Object getRootData() ( Object root Data = null; if (root - null)
public Object getRootData() Object root Data = null; if (root != null) rootData = root.getData(); return rootData; } // end getRoot Data protected void setRoot Data (Object rootData) { root.setData (rootData); } // end setRootData protected void setRootNode (BinaryNode rootNode) { root = rootNode; } // end setRootNode protected BinaryNode getRootNode () { return root; } // end getRootNode public boolean isEmpty() { null; { return root } // end isEmpty public void clear () ( C root = null; } // end clear public int getHeight () 1 return getHeight (root); } // end getHeight public int getHeight (BinaryNode node) int height <= 0; // ADD YOUR CODE HERE return height; } // end getHeight public int getNumberOfNodes () { return getNumberOfNodes (root); 1
} // end getNumberOfNodes public int getNumberOfNodes (BinaryNode node) { int number = 0; // ADD YOUR CODE HERE return number; } // end getNumberOfNodes public void preorder (BinaryNode node) { // ADD YOUR CODE HERE } // end preorder public void postorder (BinaryNode node) [ // ADD YOUR CODE HERE } // end postorder public void inorder (BinaryNode node) { // ADD YOUR CODE HERE } // end inorder public void levelorder (BinaryNode node) { // ADD YOUR CODE HERE } } // end BinaryTree