学步园

（1）折半查找，需要注意循环终止条件 和 high = mid - 1;以及low = mid + 1;

public int search(int[] data, int key) {<br /> int low = 0;<br /> int high = data.length - 1;<br /> int mid;<br /> if (data == null)<br /> return -1;</p> <p> if (key > data[high]) {<br /> return -1;<br /> }</p> <p> if (key < data[low]) {<br /> return -1;<br /> }</p> <p> while (low <= high) {<br /> mid = (low + high) / 2;<br /> System.out.println("mid " + mid + " mid value:" + data[mid]);// /<br /> if (key < (data[mid])) {<br /> high = mid - 1;<br /> } else if (key > data[mid]) {<br /> low = mid + 1;<br /> } else if (key == data[mid]) {<br /> return mid;<br /> }<br /> }<br /> return -1;<br /> }  

（2）二叉树非递归先序遍历

public void preTraversal(BiTree root) {<br /> while (root != null || !statck.isEmpty()) {<br /> while (root != null) {<br /> visit(root);<br /> stack.push(root);<br /> root = root.leftChild;<br /> }</p> <p> if (!statck.isEmpty()) {<br /> root = stack.pop();<br /> root = root.rightChild;<br /> }<br /> }<br /> }

（3）二叉树非递归中序遍历

public void MidTraversal(BiTree root) {<br /> while (root != null || !statck.isEmpty()) {<br /> while (root != null) {<br /> stack.push(root);<br /> root = root.leftChild;<br /> }</p> <p> if (!statck.isEmpty()) {<br /> root = stack.pop();<br /> visit(root);<br /> root = root.rightChild;<br /> }<br /> }<br /> }