ShortBTNode

java.lang.Object
- edu.colorado.nodes.ShortBTNode

```
public class ShortBTNode
extends java.lang.Object
```
A ShortBTNode provides a node for a binary tree. Each node contains a piece of data (which is a reference to an object) and references to a left and right child. The references to children may be null to indicate that there is no child. The reference stored in a node can also be null. Limitations: Beyond Int.MAX_VALUE elements, treeSize, is wrong. Java Source Code for this class: http://www.cs.colorado.edu/~main/edu/colorado/nodes/ShortBTNode.java

See Also:

BTNode, BooleanBTNode, ByteBTNode, CharBTNode, DoubleBTNode, FloatBTNode, IntBTNode, LongBTNode

Constructor Summary

Constructors
Constructor and Description
`ShortBTNode(short initialData, ShortBTNode initialLeft, ShortBTNode initialRight)` Initialize a `ShortBTNode` with a specified initial data and links children.

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`short`	`getData()` Accessor method to get the data from this node.
`ShortBTNode`	`getLeft()` Accessor method to get a reference to the left child of this node.
`short`	`getLeftmostData()` Accessor method to get the data from the leftmost node of the tree below this node.
`ShortBTNode`	`getRight()` Accessor method to get a reference to the right child of this node.
`short`	`getRightmostData()` Accessor method to get the data from the rightmost node of the tree below this node.
`void`	`inorderPrint()` Uses an inorder traversal to print the data from each node at or below this node of the binary tree.
`boolean`	`isLeaf()` Accessor method to determine whether a node is a leaf.
`void`	`postorderPrint()` Uses a postorder traversal to print the data from each node at or below this node of the binary tree.
`void`	`preorderPrint()` Uses a preorder traversal to print the data from each node at or below this node of the binary tree.
`void`	`print(int depth)` Uses an inorder traversal to print the data from each node at or below this node of the binary tree, with indentations to indicate the depth of each node.
`ShortBTNode`	`removeLeftmost()` Remove the leftmost most node of the tree below this node.
`ShortBTNode`	`removeRightmost()` Remove the rightmost most node of the tree below this node.
`void`	`setData(short newData)` Modification method to set the data in this node.
`void`	`setLeft(ShortBTNode newLeft)` Modification method to set the link to the left child of this node.
`void`	`setRight(ShortBTNode newRight)` Modification method to set the link to the right child of this node.
`static ShortBTNode`	`treeCopy(ShortBTNode source)` Copy a binary tree.
`static int`	`treeSize(ShortBTNode root)` Count the number of nodes in a binary tree.

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - ShortBTNode
```
public ShortBTNode(short initialData,
                   ShortBTNode initialLeft,
                   ShortBTNode initialRight)
```
    Initialize a ShortBTNode with a specified initial data and links children. Note that a child link may be the null reference, which indicates that the new node does not have that child.
    
    Parameters:
    
    initialData - the initial data of this new node
    
    initialLeft - a reference to the left child of this new node--this reference may be null to indicate that there is no node after this new node.
    
    initialRight - a reference to the right child of this new node--this reference may be null to indicate that there is no node after this new node. Postcondition: This node contains the specified data and links to its children.
- Method Detail
  - getData
```
public short getData()
```
    Accessor method to get the data from this node.
    
    Returns:
    
    the data from this node
  - getLeft
```
public ShortBTNode getLeft()
```
    Accessor method to get a reference to the left child of this node.
    
    Returns:
    
    a reference to the left child of this node (or the null reference if there is no left child)
  - getLeftmostData
```
public short getLeftmostData()
```
    Accessor method to get the data from the leftmost node of the tree below this node.
    
    Returns:
    
    the data from the deepest node that can be reached from this node by following left links.
  - getRightmostData
```
public short getRightmostData()
```
    Accessor method to get the data from the rightmost node of the tree below this node.
    
    Returns:
    
    the data from the deepest node that can be reached from this node by following right links.
  - getRight
```
public ShortBTNode getRight()
```
    Accessor method to get a reference to the right child of this node.
    
    Returns:
    
    a reference to the right child of this node (or the null reference if there is no right child)
  - inorderPrint
```
public void inorderPrint()
```
    Uses an inorder traversal to print the data from each node at or below this node of the binary tree. Postcondition: The data of this node and all its descendants have been writeen by System.out.println( ) using an inorder traversal.
  - isLeaf
```
public boolean isLeaf()
```
    Accessor method to determine whether a node is a leaf.
    
    Returns:
    
    true (if this node is a leaf) or false (if this node is not a leaf.
  - preorderPrint
```
public void preorderPrint()
```
    Uses a preorder traversal to print the data from each node at or below this node of the binary tree. Postcondition: The data of this node and all its descendants have been writeen by System.out.println( ) using a preorder traversal.
  - postorderPrint
```
public void postorderPrint()
```
    Uses a postorder traversal to print the data from each node at or below this node of the binary tree. Postcondition: The data of this node and all its descendants have been writeen by System.out.println( ) using a postorder traversal.
  - print
```
public void print(int depth)
```
    Uses an inorder traversal to print the data from each node at or below this node of the binary tree, with indentations to indicate the depth of each node.
    
    Parameters:
    
    depth - the depth of this node (with 0 for root, 1 for the root's children, and so on)( Precondition: depth is the depth of this node. Postcondition: The data of this node and all its descendants have been writeen by System.out.println( ) using an inorder traversal. The indentation of each line of data is four times its depth in the tree. A dash "--" is printed at any place where a child has no sibling.
  - removeLeftmost
```
public ShortBTNode removeLeftmost()
```
    Remove the leftmost most node of the tree below this node.
    
    Returns:
    
    The tree starting at this node has had its leftmost node removed (i.e., the deepest node that can be reached by following left links). The return value is a reference to the root of the new (smaller) tree. This return value could be null if the original tree had only one node (since that one node has now been removed).
  - removeRightmost
```
public ShortBTNode removeRightmost()
```
    Remove the rightmost most node of the tree below this node.
    
    Returns:
    
    The tree starting at this node has had its rightmost node removed (i.e., the deepest node that can be reached by following right links). The return value is a reference to the root of the new (smaller) tree. This return value could be null if the original tree had only one node (since that one node has now been removed).
  - setData
```
public void setData(short newData)
```
    Modification method to set the data in this node.
    
    Parameters:
    
    newData - the new data to place in this node Postcondition: The data of this node has been set to newData.
  - setLeft
```
public void setLeft(ShortBTNode newLeft)
```
    Modification method to set the link to the left child of this node.
    
    Parameters:
    
    newLeft - a reference to the node that should appear as the left child of this node (or the null reference if there is no left child for this node) Postcondition: The link to the left child of this node has been set to newLeft. Any other node (that used to be the left child) is no shorter connected to this node.
  - setRight
```
public void setRight(ShortBTNode newRight)
```
    Modification method to set the link to the right child of this node.
    
    Parameters:
    
    newRight - a reference to the node that should appear as the right child of this node (or the null reference if there is no right child for this node) Postcondition: The link to the right child of this node has been set to newRight. Any other node (that used to be the right child) is no shorter connected to this node.
  - treeCopy
```
public static ShortBTNode treeCopy(ShortBTNode source)
```
    Copy a binary tree.
    
    Parameters:
    
    source - a reference to the root of a binary tree that will be copied (which may be an empty tree where source is null)
    
    Returns:
    
    The method has made a copy of the binary tree starting at source. The return value is a reference to the root of the copy.
    
    Throws:
    
    java.lang.OutOfMemoryError - Indicates that there is insufficient memory for the new tree.
  - treeSize
```
public static int treeSize(ShortBTNode root)
```
    Count the number of nodes in a binary tree.
    
    Parameters:
    
    root - a reference to the root of a binary tree (which may be an empty tree where source is null)
    
    Returns:
    
    the number of nodes in the binary tree Note: A wrong answer occurs for trees larger than INT.MAX_VALUE.

Class ShortBTNode

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

ShortBTNode

Method Detail

getData

getLeft

getLeftmostData

getRightmostData

getRight

inorderPrint

isLeaf

preorderPrint

postorderPrint

print

removeLeftmost

removeRightmost

setData

setLeft

setRight

treeCopy

treeSize