The tree is one of the most important data structures in computer programming.
A very common of example of the tree data structure being used in everyday life is a directory structure widely used both in Windows and Unix systems.
Today I will write a brief tutorial on trees, and show a number of common operations done on the structure of a tree. The code examples will be in Java.
First, let's create a tree. A tree is essentially a set of node objects that hold some data and each node has zero or more "child" nodes. The nodes without any child nodes are called leaves and the node that itself is not a child of any other node is called the root. You can read up on trees on the Web, we will focus on the implementation of trees here.
We can define a node in the tree as follows:
The class above is a simple example of a node in a tree. It contains a data variable, a reference to left and right sub-trees each, and a reference to the parent node as well. There are also a set of setters and getters to manipulate the data members. Please note that - in practice you might need much more complex nodes loaded with big data objects and more children than just a left and right nodes.
To create a tree using the class above you could do the following:
A tree is represented by the root node of the tree. So, the "root" object above represent the entire tree.
Copying a tree:
Say you have a tree that you want to copy to another tree. Now, copying can be done in two ways - i) shallow copy, and ii) deep copy.
We will show deep copy here. Deep copying means the new tree is an entirely new copy of the old tree - both in structure and in data. Everything is allocated again in memory.
The following function does a deep copy of a tree to another tree:
This function can be called like this:
Node copy = new Node(root); // copy the root
Now, the tree referenced by "copy" holds an entire deep copy of the tree "root".
Pruning a tree:
Pruning means deleting one or more subtrees of a tree. We will implement a filter-based pruning here. That is, whenever a node will match some criteria described in a filter we will delete that node along with all its children from its parent.
First, we will need a way to represent a filter. We will do that by way of an interface that all filter classes will have to implement.
Now, we can define a Filter class as follows:
This class indicates that we would like to delete all sub-trees rooted at a node containing the data value 200.
The pruning class will be a lot like the deep copying class. This is because the pruned tree is actually a deep copy of the original tree minus the pruned nodes!
Here is what the pruning method looks like:
This method can be called as follows:
At this point, the node object "copy" will contain a pruned version of the original tree rooted at "root".
Finally, here is a small class that can print a tree in pre-order traversal. I used this class in testing out the code in this post:
I hope you will now be able to create simple trees quickly. It won't be hard to modify these classes and methods to build more complex tree classes to handle more than two children, copying a subtree instead of the whole tree, prune more selectively, etc.
Happy tree coding:)
A very common of example of the tree data structure being used in everyday life is a directory structure widely used both in Windows and Unix systems.
Today I will write a brief tutorial on trees, and show a number of common operations done on the structure of a tree. The code examples will be in Java.
First, let's create a tree. A tree is essentially a set of node objects that hold some data and each node has zero or more "child" nodes. The nodes without any child nodes are called leaves and the node that itself is not a child of any other node is called the root. You can read up on trees on the Web, we will focus on the implementation of trees here.
We can define a node in the tree as follows:
class Node
{
private int data; /// this can be more complex objects
private Node left;
private Node right;
private Node parent;
public Node(int value)
{
data = value; // we could also use setter/getter for this value
parent = null; // this is optional, but having this is often useful
left = null;
right = null;
}
public Node(Node node) // copy constructor
{
data = node.getData();
left = null;
right = null;
parent = null;
}
public void setData(int data)
{
this.data = data;
}
public int getData()
{
return data;
}
public void setLeftNode(Node node)
{
left = node;
}
public Node getLeftNode()
{
return left;
}
public void setRightNode(Node node)
{
right = node;
}
public Node getRightNode()
{
return right;
}
public void setParentNode(Node node)
{
parent = node;
}
public Node getParentNode()
{
return parent;
}
}
{
private int data; /// this can be more complex objects
private Node left;
private Node right;
private Node parent;
public Node(int value)
{
data = value; // we could also use setter/getter for this value
parent = null; // this is optional, but having this is often useful
left = null;
right = null;
}
public Node(Node node) // copy constructor
{
data = node.getData();
left = null;
right = null;
parent = null;
}
public void setData(int data)
{
this.data = data;
}
public int getData()
{
return data;
}
public void setLeftNode(Node node)
{
left = node;
}
public Node getLeftNode()
{
return left;
}
public void setRightNode(Node node)
{
right = node;
}
public Node getRightNode()
{
return right;
}
public void setParentNode(Node node)
{
parent = node;
}
public Node getParentNode()
{
return parent;
}
}
The class above is a simple example of a node in a tree. It contains a data variable, a reference to left and right sub-trees each, and a reference to the parent node as well. There are also a set of setters and getters to manipulate the data members. Please note that - in practice you might need much more complex nodes loaded with big data objects and more children than just a left and right nodes.
To create a tree using the class above you could do the following:
Node root = new Node(100); // creating a root node with value 100
root.setLeftNode(new Node(200));
root.setRightNode(new Node(50));
root.getLeftNode().setLeftNode(new Node(10));
root.getLeftNode().setRightNode(new Node(1000));
A tree is represented by the root node of the tree. So, the "root" object above represent the entire tree.
Copying a tree:
Say you have a tree that you want to copy to another tree. Now, copying can be done in two ways - i) shallow copy, and ii) deep copy.
We will show deep copy here. Deep copying means the new tree is an entirely new copy of the old tree - both in structure and in data. Everything is allocated again in memory.
The following function does a deep copy of a tree to another tree:
public void deepCopy(Node root, Node copy)
{
Node left = root.getLeftNode();
Node right = root.getRightNode();
if (left != null)
{
copy.setLeftNode(new Node(left));
deepCopy(left, copy.getLeftNode());
}
if (right != null)
{
copy.setRightNode(new Node(right));
deepCopy(right, copy.getRightNode());
}
}
This function can be called like this:
Node copy = new Node(root); // copy the root
deepCopy(root, copy); // copy the rest of the tree
Now, the tree referenced by "copy" holds an entire deep copy of the tree "root".
Pruning a tree:
Pruning means deleting one or more subtrees of a tree. We will implement a filter-based pruning here. That is, whenever a node will match some criteria described in a filter we will delete that node along with all its children from its parent.
First, we will need a way to represent a filter. We will do that by way of an interface that all filter classes will have to implement.
interface Filter
{
public boolean check(Node node);
}
{
public boolean check(Node node);
}
Now, we can define a Filter class as follows:
class MyFilter implements Filter
{
public boolean check(Node node)
{
if (node.getData() == 200)
return false;
return true;
}
}
{
public boolean check(Node node)
{
if (node.getData() == 200)
return false;
return true;
}
}
This class indicates that we would like to delete all sub-trees rooted at a node containing the data value 200.
The pruning class will be a lot like the deep copying class. This is because the pruned tree is actually a deep copy of the original tree minus the pruned nodes!
Here is what the pruning method looks like:
public void pruneTree(Node root, Node copy, Filter filter)
{
Node left = root.getLeftNode();
if (left != null && filter.check(left))
{
copy.setLeftNode(new Node(left));
pruneTree(left, copy.getLeftNode(), filter);
}
Node right = root.getRightNode();
if (right != null && filter.check(right))
{
copy.setRightNode(new Node(right));
pruneTree(right, copy.getRightNode(), filter);
}
}
This method can be called as follows:
Node copy = new Node(root);
Filter filter = new MyFilter();
pruneTree(root, copy, filter);
At this point, the node object "copy" will contain a pruned version of the original tree rooted at "root".
Finally, here is a small class that can print a tree in pre-order traversal. I used this class in testing out the code in this post:
public void printTree(Node root)
{
if (root != null)
{
System.out.println(root.getData());
System.out.println(root.getData());
printTree(root.getLeftNode());
printTree(root.getRightNode());
}
}
I hope you will now be able to create simple trees quickly. It won't be hard to modify these classes and methods to build more complex tree classes to handle more than two children, copying a subtree instead of the whole tree, prune more selectively, etc.
Happy tree coding:)
