luke-else/DataStructuresCSharp
1
0
Fork 0
Code Issues 6 Pull Requests Projects 1 Releases Wiki Activity

Updated Min, Max and Find functions to use stacks

Browse Source
This commit is contained in:
Luke Else 2022-04-14 21:16:41 +01:00
parent 9de49129e7
commit 1c14ff75d6
1 changed files with 29 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
C#/Datastructures/BinaryTree/Tree.cs
View File

@ -1,4 +1,5 @@
using C_.Datastructures.BinaryTree; using C_.Datastructures.BinaryTree;
using C_.Datastructures.Stack;
using System; using System;
namespace C_.Datastructures.BinaryTree namespace C_.Datastructures.BinaryTree
@ -47,51 +48,60 @@ namespace C_.Datastructures.BinaryTree
return; return;
} }
public TreeNode<T>? Find(T value) private Stack<TreeNode<T>>? Find(T value)
{//Return true if the item can be found within the tree {//Return true if the item can be found within the tree
if (Root == default || Root.Value!.Equals(default)) if (Root == default || Root.Value!.Equals(default))
return default; return default;
TreeNode<T>? current = Root; TreeNode<T>? current = Root;
while (current != default) Stack<TreeNode<T>>? stack = Stack<TreeNode<T>>.Create(Root);
while (stack.Peek() != default)
{ {
//Compare value at node to see if we are looking for the root item //Compare value at node to see if we are looking for the root item
if (current.Value!.Equals(value)) if (stack.Peek()!.Value!.Equals(value))
return current; return stack;
current = Traverse(value, current); stack.Push(Traverse(value, stack.Peek()));
} }
return default; return default;
} }
public TreeNode<T>? Min(TreeNode<T>? node) private Stack<TreeNode<T>>? Min(TreeNode<T>? node)
{//Returns the Minimum node from a given subtree {//Returns a Stack with the value on top being the minimum of the subtree
if(node == default) if(node == default)
return default; return default;
while(true){ //Stack to store and be able to get the parent values
if (node!.Left == default) Stack<TreeNode<T>> stack = Stack<TreeNode<T>>.Create(node);
return node;
node = node.Left; while(true){
if (stack.Peek()!.Left == default)
return stack;
stack.Push(stack.Peek()!.Left);
} }
} }
public TreeNode<T>? Max(TreeNode<T>? node) private Stack<TreeNode<T>>? Max(TreeNode<T>? node)
{//Returns the Minimum node from a given subtree {///Returns a Stack with the value on top being the maximum of the subtree
if(node == default) if(node == default)
return default; return default;
while(true){ //Stack to store and be able to get the parent values
if (node!.Right == default) Stack<TreeNode<T>> stack = Stack<TreeNode<T>>.Create(node);
return node;
node = node.Right; while(true){
if (stack.Peek()!.Right == default)
return stack;
stack.Push(stack.Peek()!.Right);
} }
} }
private TreeNode<T>? Traverse(T value, TreeNode<T> node) private TreeNode<T>? Traverse(T value, TreeNode<T>? node)
{//T is comparable so use methods to determine which way to traverse {//T is comparable so use methods to determine which way to traverse
if(node == default) if(node == default)
return default; return default;