algorithms Commit Details

Date:

2013-02-20 23:28:00 (11 years 10 months ago)

Author:

Natalie Adams

Branch:

default

Commit:

e5c10fcd2400

Parents:

aae1d6bbd33b

Message:

Commiting a working example of BFS and DFS

Changes:

M	cpp/algorithms/src/Tree.h (1 diff)
M	cpp/algorithms/src/main.cpp (1 diff)

File differences

-34
35 35
36 36
37 
38 
39 
40 
41 
37
38
39
40
41
42
42 43
43 44
44 45
+␉r->addLeft(35);␍␊
␉r->addRight(50)->addRight(41);␍␊
␉Tree<int> tree(root);␍␊
␉vector<Node<int> *> nodes = tree.getBoundary(); ␍␊
␉for(size_t i = 0; i < nodes.size(); i++)␍␊
␉{␍␊
␉␉cout << nodes[i]->object << " ";␍␊
␉}␍␊
␉//vector<Node<int> *> nodes = tree.getBoundary(); ␍␊
␉//for(size_t i = 0; i < nodes.size(); i++)␍␊
␉//{␍␊
␉//␉cout << nodes[i]->object << " ";␍␊
␉//}␍␊
␉cout << tree.BFS_R(25)->object << endl;␍␊
␉cout << endl;␍␊
␉tree.DeleteTree();␍␊
␉//root->addRight(␍␊
 ␉r->addLeft(35);␍␊
 ␉r->addRight(50)->addRight(41);␍␊
 ␉Tree<int> tree(root);␍␊
-␉vector<Node<int> *> nodes = tree.getBoundary(); ␍␊
-␉for(size_t i = 0; i < nodes.size(); i++)␍␊
-␉{␍␊
-␉␉cout << nodes[i]->object << " ";␍␊
-␉}␍␊
+␉//vector<Node<int> *> nodes = tree.getBoundary(); ␍␊
+␉//for(size_t i = 0; i < nodes.size(); i++)␍␊
+␉//{␍␊
+␉//␉cout << nodes[i]->object << " ";␍␊
+␉//}␍␊
+␉cout << tree.BFS_R(25)->object << endl;␍␊
 ␉cout << endl;␍␊
 ␉tree.DeleteTree();␍␊
 ␉//root->addRight(␍␊