carrington-dev / computer_science_repo

Wits Computer Science Practice

Important Links

Other Writters

https://github.com/G33kzD3n/Catalogue/blob/master/Domain-Driven%20Design_%20Tackling%20-%20Eric%20Evans_14.pdf

UUID Generation Kotlin

https://www.uuidgenerator.net/dev-corner/kotlin

Topics

We covered a number of topics here. This repo also includes practice answers from hackerrank

Data Structures

1. Binary Search Trees
   • Insertion
   • Pr-eorder traversal
   • In-order traversal
   • Post-order traversal
   • Outline Traversal
     • recursion
     • using level counter method
   • Left Nodes Traversal Only (printout)
     • recursion
     • using level counter method
   • Right Nodes Traversal Only (printout)
   • Change order traversal
   • Level order traversal
     • using a queue
     • using level counter method
     • recursion
   • Todo
     • Tree Length
     • Leaf Node Print Out

25 20 36 10 22 30 40 5 12 28 38 48 -1
25 20 36 10 22 30 40 5 12 28 38 48 21 24 23 29 37 47 46 -1
25 20 36 10 22 23 30 40 5 12 28 38 48 21 24 29 37 47 46 -1

2. Linked List (Singly)

   • Insertion
   • Merge
   • reversing
   • Insert at index (to checkout)
   • Add a tail

3. Queue

   • insert
   • pop
   • top
   • use cases
   • size

4. Stack

   • insert
   • pop
   • top
   • use cases
   • size

5. Vector

   • insert
   • pop
   • top
   • index at
   • size
   • reallocate
   • allocate
   • top
   • last

6. HashMap

7. Heap

8. Graphs

https://github.com/Carrington-dev/IDSA
https://www.geeksforgeeks.org/binary-search-tree-data-structure/

https://python-book.softuni.org/chapter-11-tricks-and-hacks.html