mightypy.data_structures package

Module contents

mightypy.dsa

class BST

Bases: object

insert(val)

traverse(order='level')

class BinaryTree

Bases: object

property height

insert(val)

Level order insertion.

https://en.wikipedia.org/wiki/Breadth-first_search

Parameters:

val (Any) – value of the node in tree.

invert()

traverse(order='in', method='stack')

Tree traversal operation

Parameters:

order (str, optional) – order in which the tree will be traversed. Defaults to “in”. Options available - “level”,”in”,”pre”,”post”

Raises:

ValueError – If wrong order is passed. only “level”,”in”,”pre”,”post” is allowed

Returns:

Values of tree nodes in specified order

Return type:

values (list)

class LinkedList

Bases: object

append(value)

Insert at the end.

Parameters:

value (object) – Value to insert in linked list

push(value)

Push at the begining.

Parameters:

value (object) – Value to push to list

traverse()

Traverse the linked list.

Returns:

linked list values

Return type:

node_values (list)

binary_search(arr: List[int | float | str], ele: int | float | str) → Tuple[bool, int] | Tuple[bool, None]

Binary search algorithm

Parameters:

• arr (List[Union[int,float,str]]) – array list to search

• ele (Union[int, float, str]) – element to search

Returns:

result of bianry search

Return type:

Union[Tuple[bool, int], Tuple[bool, None]]

linear_search(arr: List[int | float | str], ele: int | float | str) → Tuple[bool, int] | Tuple[bool, None]

Linear search algorithm

Parameters:

• arr (List[Union[int,float,str]]) – array list to search

• ele (Union[int, float, str]) – element to search

Returns:

result of linear search

Return type:

Union[Tuple[bool, int], Tuple[bool, None]]