arungmkumar / create-a-BST Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Create a Binary Search Tree from list A A containing N N elements. Insert elements in the same order as given. Print the pre-order traversal of the subtree with root node data equal to Q Q (inclusive of Q Q), separating each element by a space.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
BST.cpp		BST.cpp
BST.h		BST.h
Main.cpp		Main.cpp
README.md		README.md

Repository files navigation

create-a-BST

Create a Binary Search Tree Implementation in c++.

About

Create a Binary Search Tree from list A A containing N N elements. Insert elements in the same order as given. Print the pre-order traversal of the subtree with root node data equal to Q Q (inclusive of Q Q), separating each element by a space.

Report repository

Releases

No releases published

Packages

No packages published

Languages

C++ 100.0%