Source Code

 
Source code are the collections of coding interview questions and their source code. Click the title you are interested, you will find the download link of the source code. Cannot find what you want? Please check out my github and my Java coding book.

 

Implement binary search tree

A binary search tree is an ordered binary tree. The left subtree contains nodes whose keys are less than the ...
Binary search tree with parent feature

Implement binary search tree with parent pointer

In a binary search tree, a node has two references, left child and right child. A binary search tree with ...
circular queue

Implement circular queue using an array

A circular queue is a queue in which all elements are connected to form a circular. A circular queue can ...

Implement priority queue using an array

A priority queue is a queue in which you insert an element at the back (enqueue) and remove an element ...
trie feature list

Implement trie using linked lists

A trie is a tree-like data structure in which every node stores a character. A trie can store multiple words ...

Implement trie using hashmaps

A trie is a tree-like data structure in which every node stores a character. A tire can store one or ...

Implement trie using arrays

A trie is a tree-like data structure in which every node stores a character. A trie can store multiple words ...
hashtable feature

Implement hash table

Hash table is a data structure that can map keys to values. A hash table uses a hash function to ...
maxheap feature

Implement max heap

Max heap is a complete binary tree, in which all levels are completely filled and all the nodes in the ...
minheap feature

Implement min heap

Min heap is a complete binary tree, in which all levels are completely filled and all the nodes in the ...

 

Comments are closed