lifegpc/c-utils
1
0
Fork 0
mirror of https://github.com/lifegpc/c-utils.git synced 2026-06-23 20:26:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add binary tree and binary search tree

Browse Source
This commit is contained in:
lifegpc
2024-07-16 12:03:46 +08:00
parent 7d466865f5
commit 4321573b29
6 changed files with 310 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

72
test/binary_tree_test.cpp Normal file
View File

@@ -0,0 +1,72 @@
#include "gtest/gtest.h"
#include "binary_search_tree.h"
#include <string>
TEST(BinaryTreeTest, BinaryTree1) {
struct BinaryTree<int>* top = binary_tree_new(1);
top->left = binary_tree_new(2);
top->right = binary_tree_new(3);
top->left->left = binary_tree_new(4);
top->left->right = binary_tree_new(5);
top->right->right = binary_tree_new(6);
std::string text;
binary_tree_dfs(top, [&text](struct BinaryTree<int>* ele) {
if (!text.empty()) {
text += ",";
}
text += std::to_string(ele->data);
});
GTEST_ASSERT_EQ(text, "4,5,2,6,3,1");
text = "";
binary_tree_lnr(top, [&text](struct BinaryTree<int>* ele) {
if (!text.empty()) {
text += ",";
}
text += std::to_string(ele->data);
});
GTEST_ASSERT_EQ(text, "4,2,5,1,3,6");
text = "";
binary_tree_nlr(top, [&text](struct BinaryTree<int>* ele) {
if (!text.empty()) {
text += ",";
}
text += std::to_string(ele->data);
});
GTEST_ASSERT_EQ(text, "1,2,4,5,3,6");
text = "";
binary_tree_bfs(top, [&text](struct BinaryTree<int>* ele) {
if (!text.empty()) {
text += ",";
}
text += std::to_string(ele->data);
});
GTEST_ASSERT_EQ(text, "1,2,3,4,5,6");
binary_tree_clear(top);
}
TEST(BinaryTreeTest, BinarySearchTree1) {
BinarySearchTree<int, int>* tree = nullptr;
binary_search_tree_insert(tree, 100, 3);
GTEST_ASSERT_EQ(tree->data.key, 100);
GTEST_ASSERT_EQ(tree->data.value, 3);
binary_search_tree_insert(tree, 100, 20);
GTEST_ASSERT_EQ(tree->data.value, 20);
binary_search_tree_insert(tree, 20, 45);
binary_search_tree_insert(tree, 40, 13);
binary_search_tree_insert(tree, 33, 23);
binary_search_tree_insert(tree, 77, 33);
binary_search_tree_insert(tree, 120, 222);
std::string keys;
std::string values;
binary_search_tree_iter(tree, [&keys, &values](int key, int value) {
if (!keys.empty()) {
keys += ",";
values += ",";
}
keys += std::to_string(key);
values += std::to_string(value);
});
GTEST_ASSERT_EQ(keys, "20,33,40,77,100,120");
GTEST_ASSERT_EQ(values, "45,23,13,33,20,222");
binary_search_tree_clear(tree);
}

20
test/queue_test.cpp
View File

@@ -85,8 +85,7 @@ TEST(Queue_Test, CircularQueue2) {
TEST(Queue_Test, LinkedQueue1) {
struct LinkedQueue<int> queue;
queue.front = nullptr;
queue.rear = nullptr;
linked_queue_init(queue);
EXPECT_EQ(linked_queue_push(queue, 3), true);
EXPECT_EQ(linked_queue_push(queue, 4), true);
EXPECT_EQ(linked_queue_push(queue, 9), true);
@@ -105,3 +104,20 @@ TEST(Queue_Test, LinkedQueue1) {
EXPECT_EQ(text, "4,9,7");
free_linked_queue(queue);
}
TEST(Queue_Test, LinkedQueue2) {
struct LinkedQueue<int> queue;
linked_queue_init(queue);
EXPECT_EQ(linked_queue_push(queue, 3), true);
EXPECT_EQ(linked_queue_push(queue, 4), true);
EXPECT_EQ(linked_queue_push(queue, 9), true);
int v;
EXPECT_EQ(linked_queue_pop(queue, v), true);
EXPECT_EQ(v, 3);
EXPECT_EQ(linked_queue_pop(queue, v), true);
EXPECT_EQ(linked_queue_pop(queue, v), true);
EXPECT_EQ(linked_queue_pop(queue, v), false);
EXPECT_EQ(v, 9);
EXPECT_EQ(queue.front, nullptr);
EXPECT_EQ(queue.rear, nullptr);
}