MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / preOrder

Method preOrder

Trees/delete_nodes_BST.cpp:56–64  ·  view source on GitHub ↗

RECURSIVE DFS PREORDER

Source from the content-addressed store, hash-verified

54
55 //RECURSIVE DFS PREORDER
56 void preOrder()
57 {
58 if(this!=nullptr)
59 {
60 cout<<this->val<<",";
61 this->left->preOrder();
62 this->right->preOrder();
63 }
64 }
65};
66
67Tree* deleteNode(Tree *root, int val)

Callers 1

mainFunction · 0.80

Calls

no outgoing calls

Tested by

no test coverage detected