# ---
# jupyter:
#   jupytext:
#     text_representation:
#       extension: .py
#       format_name: light
#       format_version: '1.5'
#       jupytext_version: 1.14.4
#   kernelspec:
#     display_name: Java
#     language: java
#     name: python397jvsc74a57bd0aee8b7b246df8f9039afb4144a1f6fd8d2ca17a180786b69acc140d282b71a49
# ---

# # This Is A ReadMe File For The Binary Search Tree

# >- Creating a binary and its elements
# >- Adding elements to the binary trees
# >- Removing elements from the binary tree
# >- Get the height of elements in  the binary tree
# >- Depth First Search (In order, post order , pre-order)
# >- Breath First Search 
# >- Finding the minimum and maximum value in the binary tree
# >- In order, post order , pre-order
# >- Searching/checking for elements in the binary tree
#
#
#
#
#
#

# Adding elements to the tree
# ---------------

# 1. First a class called TreeNodes was created and then in it the  left node, right node and the int leaves was stored in it. 
#
# 2. Then  a function called createNewTreeNode was created and in it creates a 3 different variables under the new variables called new tree node this allows newTreeNode.left, newTreeNode.right, and  newTreeNode.leaves to be diretly saved in the object TreeNode. The newTreeNode.left and newTreeNode.right are currently null in this function because no data has been saved in them and the  newTreeNode.leaves variable stores the integer variable data because that is what is going to directly hold all the data in the nodes.
#
# 3. Once this is completed the newTreeNode was returned  and the function/method was called in the BST class and the tree was created.
#

# Finding The height of the tree
# ---------------

# >- There is no need to enter a value within this method as it already find the height of the tree.

# Pre-Order, Post-Order and In-Order Traversal & Depth First Search
# ---------------

# >- There is also no need to mannually enter a value within these methods as they already find the traverse the tree in their specified order. 

# Breath First Search
# ---------------

# >- There is also no need to mannually enter a value within this methods as it already carries out the process of traversing/searching the tree in  their spercifired order.

# Finding the minimum and maximum value in the binary tree
# ---------------

# >- The minumum value can be manually altered my chaing the values store in the binery tree itself in the main class.

# Searching/checking for elements in the binary tree
# ---------------

# >-  This can be done by manually enering values that are present and not present in the binary tree into the method. Once this is entered and runed the value present in the binary tree should be return a "true" result and the value not present should return a "false" result.

# Removing  elements in the binary tree
# ---------------

# >-  This can be done by manually enering values that are present and not present in the binary tree into the method.Once this is done amd run the method should return the deleted node as a result

StarcoderdataJupyterScriptsDedupFiltered