Add binary tree and binary search tree

This commit is contained in:
2024-07-16 12:03:46 +08:00
parent 7d466865f5
commit 4321573b29
6 changed files with 310 additions and 3 deletions

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);
}