Xzping96的博客

栈的链式存储实现代码：public class LinkStack<E> { //定义一个内部类Node，Node实例代表链栈的节点 private class Node{ private E data; private Node next; public Node(){ } public Node(E

public class BinarySearchTree { //内部类，代表二叉搜索树的一个节点 private class TreeNode{ int element; TreeNode left; TreeNode right; }// //递归搜索查找// public TreeNode Find(int x,