recurAndFind(String str, Node x, char c){ if(x== null); if(x.getChar() == c) return str; else if(x.hasLeft()) recurAndFind("0"+str,x.left,c); else if(x.hasright()) recurAndFind("1"+str,x.right,c); }
public String toString(int indent) { StringBuilder buffer = new StringBuilder(); buffer.append(toStringDisplayName()); buffer.append("\r\n"); toStringIndent(indent, buffer); if (hasLeft()) { buffer.append("Left: " + getLeft().toString(indent + 1)); } else { buffer.append("Left: null"); } buffer.append("\r\n"); toStringIndent(indent, buffer); if (hasRight()) { buffer.append("Right: " + getRight().toString(indent + 1)); } else { buffer.append("Right: null"); } return buffer.toString(); }
public String toString(int indent) { StringBuilder buffer = new StringBuilder(); buffer.append(toStringDisplayName()); buffer.append("\r\n"); toStringIndent(indent, buffer); if (hasLeft()) { buffer.append("Left: " + getLeft().toString(indent + 1)); } else { buffer.append("Left: null"); } buffer.append("\r\n"); toStringIndent(indent, buffer); if (hasRight()) { buffer.append("Right: " + getRight().toString(indent + 1)); } else { buffer.append("Right: null"); } return buffer.toString(); }
public String toString(int indent) { StringBuffer buffer = new StringBuffer(); buffer.append(toStringDisplayName()); buffer.append("\r\n"); toStringIndent(indent, buffer); if (hasLeft()) { buffer.append("Left: " + getLeft().toString(indent + 1)); } else { buffer.append("Left: null"); } buffer.append("\r\n"); toStringIndent(indent, buffer); if (hasRight()) { buffer.append("Right: " + getRight().toString(indent + 1)); } else { buffer.append("Right: null"); } return buffer.toString(); }
public int findNodeN(Node node, int n, int callNumber) //Call initially with findNodeN(tree.getRoot(), n, 0) { if (node.hasLeft()) findNodeN(node.getLeftChild(), n, callNumber); if (callNumber == n) return node.getElement(); else callNumber++; if (node.hasRight()) printTreeInOrder(node.getRightChild(), n, callNumber); }