Iurii Tatishchev
01d2d7f2cf
- Modify the Park class from previous assignments. - Rewrite the private insert as a recursive function. - Write the buildBST() function (similar to buildList() in the doubly-linked list lab). - Display the number of nodes in the tree as shown below: - Display the tree in inorder, preorder or postorder - Display the tree as an indented list - Display the inner nodes of the BST (including its root), in alphabetical order by code - Write the searchManager() function (similar to searchManager() in the doubly-linked list lab). It calls search BST in a loop. - Search the BST (implement the recursive private search function).
12 lines
219 B
CMake
12 lines
219 B
CMake
cmake_minimum_required(VERSION 3.28)
|
|
project(05_trees)
|
|
|
|
set(CMAKE_CXX_STANDARD 20)
|
|
|
|
add_executable(05_trees main.cpp
|
|
BinaryTree.h
|
|
BinaryNode.h
|
|
BinarySearchTree.h
|
|
Park.cpp
|
|
Park.h)
|