Data Structures in Java

Binary Tree

javac BinaryTree.java && java BinaryTree

Insert a number or 'exit' to quit: 
>>> 1
Added: 1
Insert a number or 'exit' to quit: 
>>> 1
Added: 1
Insert a number or 'exit' to quit: 
>>> 5
Added: 5
Insert a number or 'exit' to quit: 
>>> 10
Added: 10
Insert a number or 'exit' to quit: 
>>> 3
Added: 3
Insert a number or 'exit' to quit: 
>>> 8
Added: 8
Insert a number or 'exit' to quit: 
>>> 20
Added: 20
Insert a number or 'exit' to quit: 
>>> 3
Added: 3
Insert a number or 'exit' to quit: 
>>> 6
Added: 6
Insert a number or 'exit' to quit: 
>>> 6
Added: 6
Insert a number or 'exit' to quit: 
>>> 5
Added: 5
Insert a number or 'exit' to quit: 
>>> exit
Sorted values:
1 1 3 3 5 5 6 6 8 10 20

Set

javac Set.java && java Set 

Creating Set A: 
Insert a number or 'exit' to continue: 
>>> 1
Added: 1
Insert a number or 'exit' to continue: 
>>> 2
Added: 2
Insert a number or 'exit' to continue: 
>>> 3
Added: 3
Insert a number or 'exit' to continue: 
>>> 4
Added: 4
Insert a number or 'exit' to continue: 
>>> exit
Creating Set B: 
Insert a number or 'exit' to continue: 
>>> 3
Added: 3
Insert a number or 'exit' to continue: 
>>> 4
Added: 4
Insert a number or 'exit' to continue: 
>>> 5
Added: 5
Insert a number or 'exit' to continue: 
>>> 6
Added: 6
Insert a number or 'exit' to continue: 
>>> exit
Set A: [1, 2, 3, 4]
Set B: [3, 4, 5, 6]
Union: [1, 2, 3, 4, 5, 6]
Difference: [1, 2, 5, 6]
Intersection: [3, 4]

Recursion

javac Recursion.java && java Recursion

What is value `n`?
>>> 7
What is value `m`?
>>> 6
Calculating: A(7, 6):
>>> 21
n=1: 1  
n=2: 1  1  
n=3: 1  3  1  
n=4: 1  7  6  1  
n=5: 1  15  25  10  1  
n=6: 1  31  90  65  15  1  
n=7: 1  63  301  350  140  21  

Complexity

javac Complexity.java && java Complexity 

Linked List

javac LinkedList.java && java LinkedList

Insert a comma separated list of values:
>>> 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17
LinkedList:
|17|->|16|->|15|->|14|->|13|->|12|->|11|->|10|->|9|->|8|->|7|->|6|->|5|->|4|->|3|->|2|->|1|
Inverted LinkedList:
|1|->|2|->|3|->|4|->|5|->|6|->|7|->|8|->|9|->|10|->|11|->|12|->|13|->|14|->|15|->|16|->|17|

Insert a comma separated list of values:
>>> 
LinkedList:
|1|
Inverted LinkedList:
|1|

Stacks & Queues

javac StackedQueue.java && java StackedQueue

Insert a comma separated list of values:
>>> 1,2,3,4,5,6,7,8,9,10
How many elements to unshift from the Queue?
>>> 3
Queue:
10, 9, 8, 7, 6, 5, 4, 

Insert a comma separated list of values:
>>> 1,2,4 
How many elements to unshift from the Queue?
>>> 5
Queue:
<empty>

Insert a comma separated list of values:
>>> 1
How many elements to unshift from the Queue?
>>> 0
Queue:
1, 

Hash Map

javac HashTable.java && java HashTable

HashMap:
0 -> 96-14556 Delia Gutiérrez 5.0
1 -> 96-11797 Emely Arraiz 5.0
2 -> 96-14551 Martha Arteaga 4.5
3 -> 96-11052 Wilmer Pereira 4.5
4 -> 96-12965 Lázaro Rech 4.5
5 -> 96-14145 Steven Andrea 4.5
6 -> 96-13955 Maria Ortega 5.0
7 -> 96-12087 Alberto Mendoza 4.5
8 -> 96-14477 Oscar Meza 3.0
9 -> 96-14878 Maria Fuenmayor 5.0