Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/df/d42/binary__search__tree2_8cpp_source.html below:

TheAlgorithms/C++: data_structures/binary_search_tree2.cpp Source File

std::unique_ptr<bst_node>

;

std::unique_ptr<bst_node>

;

std::unique_ptr<bst_node>

;

}

(!

->right) {

ret_value =

->value;

}

(!

->left) {

ret_value =

->value;

(std::unique_ptr<bst_node>&

, T new_value) {

(new_value < node->value) {

->left = std::unique_ptr<bst_node>(

(new_value));

}

(new_value >

->value) {

(!

->right) {

std::unique_ptr<bst_node>(

(new_value));

(std::unique_ptr<bst_node>& parent,

std::unique_ptr<bst_node>&

, T rm_value) {

(

->value == rm_value) {

T successor_node_value{};

->value = successor_node_value;

}

(

->left ||

->right) {

std::unique_ptr<bst_node>& non_null =

= std::move(non_null);

}

(rm_value < parent->value) {

parent->left = std::move(non_null);

parent->right = std::move(non_null);

.reset(

);

}

(rm_value < parent->value) {

parent->left.reset(

);

parent->right.reset(

);

}

(rm_value < node->value) {

(value < node->value) {

}

(value >

->value) {

std::unique_ptr<bst_node>&

) {

callback(

->value);

std::unique_ptr<bst_node>&

) {

callback(

->value);

std::unique_ptr<bst_node>&

) {

callback(

->value);

std::vector<T> result;

std::vector<T> result;

std::vector<T> result;

std::cout <<

;

res = tree.

(5);

min = -1, max = -1;

assert(tree.

() == 1);

assert(tree.

() == 4);

fail_res = tree.

(4);

assert(tree.

() == 4);

std::cout <<

<< std::endl;

std::cout <<

;

res = tree.

(5);

min = -1, max = -1;

assert(tree.

() == 3);

assert(tree.

(5) ==

);

assert(tree.

() == 0);

assert(tree.

(6) ==

);

fail_res = tree.

(5);

assert(tree.

() == 0);

std::cout <<

<< std::endl;

std::cout <<

;

std::cout <<

<< std::endl;

std::cout <<

;

std::cout <<

<< std::endl;

std::cout <<

;

std::cout <<

<< std::endl;

std::cout <<

;

std::vector<int> expected = {3, 4, 5, 6};

assert(actual == expected);

std::cout <<

<< std::endl;

std::cout <<

;

std::vector<int> expected = {5, 4, 3, 6};

assert(actual == expected);

std::cout <<

<< std::endl;

std::cout <<

;

std::vector<int> expected = {3, 4, 6, 5};

assert(actual == expected);

std::cout <<

<< std::endl;

static void test_get_elements_inorder()

Function for testing get_elements_inorder().

static void test_contains()

Function for testing contains().

static void test_insert()

Function for testing insert().

static void test_get_elements_postorder()

Function for testing get_elements_postorder().

static void test_find_max()

Function for testing find_max().

static void test_get_elements_preorder()

Function for testing get_elements_preorder().

static void test_remove()

Function for testing remove().

static void test_find_min()

Function for testing find_min().

The Binary Search Tree class.

std::vector< T > get_elements_inorder()

Get all values of the BST in in-order order.

void traverse_inorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)

Recursive function to traverse the tree in in-order order.

bool find_max(T &ret_value)

Find the largest value in the BST.

std::size_t size()

Get the number of values in the BST.

std::vector< T > get_elements_preorder()

Get all values of the BST in pre-order order.

std::vector< T > get_elements_postorder()

Get all values of the BST in post-order order.

bool contains(T value)

Check if a value is in the BST.

bool find_max(std::unique_ptr< bst_node > &node, T &ret_value)

Recursive function to find the maximum value in the BST.

bool insert(T new_value)

Insert a new value into the BST.

void traverse_postorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)

Recursive function to traverse the tree in post-order order.

bool remove(T rm_value)

Remove a specified value from the BST.

bool insert(std::unique_ptr< bst_node > &node, T new_value)

Recursive function to insert a value into the BST.

std::unique_ptr< bst_node > root_

bool contains(std::unique_ptr< bst_node > &node, T value)

Recursive function to check if a value is in the BST.

binary_search_tree()

Construct a new Binary Search Tree object.

void traverse_preorder(std::function< void(T)> callback, std::unique_ptr< bst_node > &node)

Recursive function to traverse the tree in pre-order order.

bool find_min(T &ret_value)

Find the smallest value in the BST.

bool remove(std::unique_ptr< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)

Recursive function to remove a value from the BST.

bool find_min(std::unique_ptr< bst_node > &node, T &ret_value)

Recursive function to find the minimum value in the BST.

int main()

Main function.

A struct to represent a node in the Binary Search Tree.

std::unique_ptr< bst_node > right

std::unique_ptr< bst_node > left

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4