Skip to content

210CT-1819OCTJAN/Binary-Search-Tree

master
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 
 
 
 
 
 
 
 
 

Binary-Search-Tree

210CT Coursework Submission for Questions 1 and 2 Below are the functions and classes listed under their relevant question number Most work is split into files meaning Question 1 is answered mostly using BST.py and Question 2 is mostly answered using BST_Delete.py, however both use at least some code from the other file so it is not a clear split between the questions.

Question 1: Classes:

  • BSTNode
    • init(value, parent)
    • checkChildren()

Functions:

  • insertNode(tree, item, parent = None)
  • treeFromFile(fileName)
  • binaryTreeSearch(target, tree)
  • searchNoPrint(target, tree)
  • preOrder(tree)

Question 2: Classes:

  • BSTNode
    • init(value, parent)
    • checkChildren()

Functions:

  • searchNoPrint(target, tree)
  • delete(target, tree)
  • deleteNode(node)
  • deleteRoot(root)

About

Binary Search Tree Implementation for 210CT Coursework: Question 1 and Question 2

Resources

Stars

Watchers

Forks

Releases

No releases published

Languages