Introducing binary search tree implementation

[spirosmaggioros]

Implemented a binary serach tree in zig:

Methods:

• Implemented methods for inserting (insert), removing (remove), and searching (search) elements in the tree.
• Added traversal methods for inorder (inorder), preorder (preorder), and postorder (postorder) traversals.
• Included a destroy method to deallocate memory used by the tree.

Also, the PR includes the unit tests for the container.

[kassane]

Hi @spirosmaggioros,

Thanks for your contribution and happy new year!!

What is the difference compared to the previous implementation?

https://github.com/TheAlgorithms/Zig/blob/main/search%2FbinarySearchTree.zig

[spirosmaggioros]

Happy new year to you too!

Actually i want to contribute a lot and i started by trying fixing the already implemented data structures.
My implementation has more methods(the ones that we both have are the same) and also they are more user friendly. Feels more like a class(accepts T key instead of nodes), thus, having an allocator as well.

I can try and merge my additions into the already implemented file if you wish.

Thanks.
Spiros.

[kassane]

I can try and merge my additions into the already implemented file if you wish.

Please, it would help a lot, avoiding redundancies.

[spirosmaggioros]

Just commited this. I updated the BinarySearchTree.zig with the new implementation instead of creating one at dataStructures.

@kassane Do i have to add this to build.zig and runall.sh?

[kassane]

Do i have to add this to build.zig and runall.sh?

Again?

Zig/build.zig

Lines 47 to 53 in e68f833

	if (std.mem.eql(u8, op, "search/bSearchTree"))
	build_algorithm(b, .{
	.optimize = optimize,
	.target = target,
	.name = "binarySearchTree.zig",
	.category = "search",
	});

Zig/runall.cmd

Line 34 in e68f833

%ZIG_TEST% -Dalgorithm=search/bSearchTree %Args%

Zig/runall.sh

Line 34 in e68f833

$ZIG_TEST -Dalgorithm=search/bSearchTree $Args

rebase and add doublyLinkedList

[spirosmaggioros]

Do i have to add this to build.zig and runall.sh?

Again?

Zig/build.zig

Lines 47 to 53 in e68f833

	if (std.mem.eql(u8, op, "search/bSearchTree"))
	build_algorithm(b, .{
	.optimize = optimize,
	.target = target,
	.name = "binarySearchTree.zig",
	.category = "search",
	});

Zig/runall.cmd

Line 34 in e68f833

%ZIG_TEST% -Dalgorithm=search/bSearchTree %Args%

Zig/runall.sh

Line 34 in e68f833

$ZIG_TEST -Dalgorithm=search/bSearchTree $Args

rebase and add doublyLinkedList

Sorry, i forgot it exists.
Will add the following in every new PR from now on.

[kassane]

Awesome contributions, @spirosmaggioros