Binary Search Tree - Java Implementation

java data-structures tree
user1696230 picture user1696230 · Nov 14, 2012 · Viewed 114k times · Source

I'm writing a program that utilizes a binary search tree to store data. In a previous program (unrelated), I was able to implement a linked list using an implementation provided with Java SE6. Is there something similar for a binary search tree, or will I need to "start from scratch"?

Answer

Emil Sit picture Emil Sit · Nov 14, 2012

You can use a TreeMap data structure. TreeMap is implemented as a red black tree, which is a self-balancing binary search tree.

Related questions

How to implement a tree data-structure in Java?

Is there any standard Java library class to represent a tree in Java? Specifically I need to represent the following: The sub-tree at any node can have an arbitrary number of children Each node (after the root) and it's children …

Read More
Reverse A Binary Tree (Left to Right)

I was looking at interview questions and I recently came upon one that asked you how to reverse a general binary tree, like flip it from right to left. So for example if we had the binary tree 6 / \ 3 4 / \ / \ 7 3 8 1 Reversing it …

Read More
Get keys from HashMap in Java

I have a Hashmap in Java like this: private Map<String, Integer> team1 = new HashMap<String, Integer>(); Then I fill it like this: team1.put("United", 5); How can I get the keys? Something like: team1.getKey() …

Read More