xfarrow/lasd
1
0
Fork 0
mirror of https://github.com/xfarrow/lasd.git synced 2025-06-05 21:49:14 +02:00
Code Issues Packages Projects Releases Wiki Activity

Library 3

Browse Source 
fixes
This commit is contained in:
Alessandro Ferro
2021-05-10 11:18:55 +02:00
parent a66d40aab3
commit d98a0f766b
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
librerie/exercise3/binarytree/binarytree.cpp
View File

@@ -39,7 +39,7 @@ bool BinaryTree<Data>::Node::EqualNodes(const Node& n1, const Node& n2) const{
else if(!n1.HasLeftChild() && n1.HasRightChild()){ else if(!n1.HasLeftChild() && n1.HasRightChild()){
return( EqualNodes(n1.RightChild(),n2.RightChild())); return( EqualNodes(n1.RightChild(),n2.RightChild()));
} }
else if(n1.IsLeaf()) { else{ //if leaf
return true; return true;
} }
@@ -336,11 +336,11 @@ template <typename Data>
struct BinaryTree<Data>::Node* BTPostOrderIterator<Data>::DeepestLeftLeaf(struct BinaryTree<Data>::Node* node){ struct BinaryTree<Data>::Node* BTPostOrderIterator<Data>::DeepestLeftLeaf(struct BinaryTree<Data>::Node* node){
if(node->HasLeftChild()){ if(node->HasLeftChild()){
stack.Push(node); stack.Push(node);
DeepestLeftLeaf(&(node->LeftChild())); return DeepestLeftLeaf(&(node->LeftChild()));
} }
else if(node->HasRightChild()){ else if(node->HasRightChild()){
stack.Push(node); stack.Push(node);
DeepestLeftLeaf(&(node->RightChild())); return DeepestLeftLeaf(&(node->RightChild()));
} }
else else
return node; return node;
@@ -439,7 +439,7 @@ template <typename Data>
struct BinaryTree<Data>::Node* BTInOrderIterator<Data>::MostLeftNode(struct BinaryTree<Data>::Node& root){ struct BinaryTree<Data>::Node* BTInOrderIterator<Data>::MostLeftNode(struct BinaryTree<Data>::Node& root){
if(root.HasLeftChild()){ if(root.HasLeftChild()){
stack.Push(&root); stack.Push(&root);
MostLeftNode(root.LeftChild()); return MostLeftNode(root.LeftChild());
}else{ }else{
return &root; return &root;
} }