·
5 commits
to main
since this release
This realese contains the follwing classes with its methods :
Binary Tree
Iterative and Recursive Implementation :
- contains
- find
- count
- preOrder
- inOrder
- postOrder
- getDepth
- printTree
- getMin
- getMax
Standard Implementation :
- size
- isStrict
- isComplete
- isFull
- getMaxHeight
- getMinHeight
- getMinNodes
- countNodesCompleteBT
- countLeaves
- countNonLeaves
- isBST
- clear
- soString
- setUseRecursiveApproach
Binary Search Tree
Contains Binary Tree methodsn in addition to :
Iterative and Recursive Implementation :
Override
- insert
- delete
- find
- count
- getMin
- getMax
Standard Implementation :
- deadEnd
- LCA
- calcDistance
AVL
Contains Binary Search Tree methods in addition to :
Override
- insert
- delete
Standard Implementation :
- leftRotate
- rightRotate
Heap
- getRightChildIndex
- getLeftChildIndex
- getParentIndex
- swap
- printHeapTree
- clear
- toStinrg
- setUseRecursiveApproach
Max Heap
Contains Heap methods in addition to :
- heapifyDown
- heapifyUp
- insert
- remove
- delete
- buildMaxHeapArray
- heapSort
Min Heap
Contains Heap methods in addition to :
- heapifyTopDown
- heapifyBottomUp
- insert
- remove
- delete
- buildMinHeapArray
- heapSort
Priority Queue
Contains Max Heap methods in addition to :
- enqueue
- dequeue
- peek
Execution Time Calculator
- start
- stop
- getExecutionTime
- printExecutionTime
Notes
All methods are documented and add explanation comments to it
Main methd contains a brief testing with execution time calculation