Implementation of a Tree. Nodes are classes with references to the parent, an object contained and a linkedlist storing the children of the nodes. Several ways of traversing the tree are offered.
File List:
BoundaryViolationException.java
175b
EmptyTreeException.java
151b
LinkedListQueue.java
501b
LinkedTree.java
7Kb
Position.java
98b
Queue.java
235b
Tree.java
232b
Similar code
Binary Trees Simple String Example
(Popularity: ) : A very simple binary tree's example i made while trying to get the hang of it all. Shows how to add a String to the binary tree using an iterative and recursive method :)
Building and searching a binary tree
(Popularity: ) : This a a binary tree build from scratch. Input from the keyboard are storet in it, and suggestions, already in the tree, appears when writing. File Allocation Table Simulator
(Popularity: ) : This application is basically a simple simulation of 'how' the windows FAT32 works. How FAT32 organizes it's clusters, files, and directories and to simulate how does cluster fragmentation happen and how it can be resorted. This app has a basic ... Priority Queue in Java
(Popularity: ) : Implementation and short usage example of using Priority Queue in Java. Written as an exercise of Algorithmical Programming 1 course in Bar-Ilan Univercity, ISRAEL. Feel free to use it. Expression Evaluating Calculator
(Popularity: ) : It evaluates the normal infix form expression " ((101+2)*137)%3+(5*(6+7/2)) " Using ArrayList
(Popularity: ) : Shows beginners how to use Array List of Java.Util Package. Dynamicity is not shown,but altering the list is shown user-actively. EnumSuper 'family' of type-safe enumerations
(Popularity: ) : Java is missing the type-safe "enum" capability of C++ and Pascal. This software implements a reasonable, practical approach for an application to declare/define a "family" of typesafe enums, such as Color, Gender, Progress, etc. List Creator (SMSCs)
(Popularity: ) : You type in a String such as. 4x Where ever theres a pronumeral instead of a number, all possible combinations are found. For the above example 4x would give you 40, 41, 42, 43, 44, 45, 46, 47, 48 and ...
Code Library
) : A very simple binary tree's example i made while trying to get the hang of it all. Shows how to add a String to the binary tree using an iterative and recursive method :)