Lapping data structures and algorithms-basic concepts of 102 fork Trees

Binary tree node:

/*

* Binary tree node

*/

public class Node {

Data item

public Long data;

Left Dial Hand node

Public Node Leftchild;

Right child node

Public Node Rightchild;

/**

* Construction Method

* @param data

*/

Public Node (Long data) {

This.data = data;

}

}

Binary Tree class:

/*

* Two-fork Tree class

*/

public class Tree {

Root node

private Node root;

/**

* Insert Node

* @param value

*/

public void Insert (Long value) {

}

/**

* Find Nodes

* @param value

*/

public void find (Long value) {

}

/**

* Delete Node

* @param value

*/

public void Delte (Long value) {

}

}

This article is from the "8159085" blog, please be sure to keep this source http://8169085.blog.51cto.com/8159085/1696510

Lapping data structures and algorithms-basic concepts of 102 fork Trees