Pinned Repositories
BinaryTreeTool
By edges input, get TreeView, maxDepth, preOrder, inOrder, postOrder, BFS and DFS, and judge whether it is balanced tree, BST, complete tree, and full tree.
CodeInterviews
本工程收录了《剑指Offer——名企面试官精讲典型编程题（第2版）》一书的全部68道编程题及Java源码，部分源码提供了完整的main方法及测试用例。正确使用本工程需要使用JDK1.8或者更新版本，请自觉保护原书作者的知识产权。
MySort
Array sort with QuickSort, MergeSort, HeapSort, and LinkedList sort with QuickSort and MergeSort
Queue-in-Go
Queue implementation in Go, with methods: Offer(), Poll(), First(), Last(), Size(), IsEmpty().
Set-in-Go
This repository gives the implementation of set, a kind of data structure, of which the elements are non-repeated in Go, with methods: NewSet(), Add(), Remove(), Contains(), Len(), Clear(), IsEmpty(), List(). The set structure is thread safe.
Stack-in-Go
Stack implementation in Go, with functions: MakeStack(), Push(), Pop(), Peek(), Length(), Clear(), IsEmpty(), IsFull(), Traverse().
shidefu's Repositories
shidefu/CodeInterviews
本工程收录了《剑指Offer——名企面试官精讲典型编程题（第2版）》一书的全部68道编程题及Java源码，部分源码提供了完整的main方法及测试用例。正确使用本工程需要使用JDK1.8或者更新版本，请自觉保护原书作者的知识产权。
shidefu/BinaryTreeTool
By edges input, get TreeView, maxDepth, preOrder, inOrder, postOrder, BFS and DFS, and judge whether it is balanced tree, BST, complete tree, and full tree.
shidefu/MySort
Array sort with QuickSort, MergeSort, HeapSort, and LinkedList sort with QuickSort and MergeSort
shidefu/Queue-in-Go
Queue implementation in Go, with methods: Offer(), Poll(), First(), Last(), Size(), IsEmpty().
shidefu/Set-in-Go
This repository gives the implementation of set, a kind of data structure, of which the elements are non-repeated in Go, with methods: NewSet(), Add(), Remove(), Contains(), Len(), Clear(), IsEmpty(), List(). The set structure is thread safe.
shidefu/Stack-in-Go
Stack implementation in Go, with functions: MakeStack(), Push(), Pop(), Peek(), Length(), Clear(), IsEmpty(), IsFull(), Traverse().