Questions tagged [binary-search-tree]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
1 vote
1 answer
32 views

Binary Search Tree implementation in C++ with templates

Im implementing a BST using templates and dynamic memory, here is my attempt: This is the BSTNode.hh ...
user avatar
  • 269
2 votes
2 answers
36 views

Simple non balancing indexed binary search tree

The following code represents a simple indexed binary search tree of integers. The insert method inserts an int. The indexed lookup looks up the ith smallest element (0 indexed). I'm trying to write C+...
user avatar
  • 21
4 votes
2 answers
90 views

Binary Search Tree - My own version of delete function

Well, I am recently learning data structures and algorithms and I came across the Binary search tree and decided to first time use my own logic to make the delete function. I have not come across a ...
user avatar
3 votes
1 answer
67 views

Maximum Depth of Binary Tree in JavaScript

The task Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. ...
user avatar
  • 3,955
1 vote
1 answer
75 views

Binary Search tree, leaves method [closed]

I have written a code of Binary Search tree that extends comparable and implements an interface. The code for leaves and the helper method countLeaves, makes sure that all of the test goes through ...
user avatar
2 votes
1 answer
135 views

red black tree implementation in cpp

I am learning algorithms and trying to implement them in c++, I have chosen to try to implement a red-black tree due to its self-balancing properties and its ability to stop the worst case of O(n) ...
user avatar
0 votes
2 answers
136 views

c++ Most clean way to implement duplicate Binary Search Tree for complex type

I have tried to make my own implementation for a BST task I was given for a complex type (Transaction), that should be able to store duplicate values as well. However, I am not sure if I have gone ...
user avatar
3 votes
2 answers
254 views

Binary Search Tree in C++ without parent pointers

This is one more implementation of Binary Search Tree in C++. There are many such implementations, however they are typically long and complex, and also many of them rely on pointers to parent nodes ...
user avatar
  • 165
5 votes
1 answer
301 views

BST implementation in rust

I am looking for some feedback on my implementation of binary search tree in rust and I would appreciate someone taking the time to go through it and suggest any improvements or corrections as they ...
user avatar
  • 53
0 votes
1 answer
46 views

Finding inorder successor of a BST in C [closed]

Please review this code I have written a function to find the successor of BST in c. It takes three arguments, i.e root pointer to the binary search tree, node value of which we have to find a ...
user avatar
3 votes
1 answer
64 views

AVL Tree in C Criticism

I have made an AVL tree in C and coded the basic functionality of insertion, deletion, and search. I would love some criticism on my implementation especially on the insertion and deletion section of ...
user avatar
  • 403
1 vote
2 answers
81 views

Binary Search Tree without pass by reference

Here is a code for BST that I have written , that does not use pass by reference. Help me to find flaws in its design. Also I do not like the function getReqNodes, ...
user avatar
  • 205
3 votes
0 answers
122 views

LeetCode 173: Binary Search Tree Iterator

The original problem statement is here, here is the super short summary: Your binary search tree iterator must implement the following interface: ...
user avatar
  • 315
-2 votes
1 answer
62 views

Validate Search Binary Tree [closed]

I was looking to this exercise: Is Valid Binary Search Tree I tried to do the exercise by myself without looking to the solution and my code is "much simpler" than the code I found at the ...
user avatar
  • 105
7 votes
1 answer
650 views

AVL Tree in C++

After not programming in c++ for some time, I decided to write an AVL tree implementation to get back in shape (I wasn't that good anyway. Still an amateur). Header File bst.hpp ...
user avatar
9 votes
1 answer
687 views

Using smart pointers to construct Binary Search Tree

I have three main questions: Am I using std::unique_ptr correctly here? Using std::move and ...
user avatar
  • 375
3 votes
0 answers
74 views

STL compatible Binary Search Tree with unique_ptr (unit test included)

I am trying to create a Binary Search Tree, which has STL support (iterators etc.). This is my first attempt. Everything is unit tested using Catch2. Could you please review what I missed and what I ...
user avatar
  • 131
8 votes
1 answer
1k views

Red-Black Tree Implementation in Python

I'm wondering if there are better practices, and optimizations I could make on my code, to do things easier/faster. I have added comments, in many places in the code, to make understanding easier. <...
user avatar
0 votes
1 answer
207 views

Implementing a binary search tree using std::unique_ptr

I have implemented a binary search tree with 2 operations to begin with. I have tried to implement it using the best practices I could think of. Overall, I am happy with the implementation. But, I ...
user avatar
4 votes
1 answer
73 views

BST implementation (MIT OCW Runway scheduling problem) + Unit Testing in Python3

Inspired by MIT OCW (6.006)'s lecture on BSTs, I implemented them with the slight tweak where an element has to satisfy the "k-minute check" before insertion. If its value is within k of any other ...
user avatar
4 votes
1 answer
108 views

Binary Search Tree (BST) Implementation

This is the first Time implementing a Binary Search Tree, based on how it works from the visualgo website. I made this algorithm purely based on what I saw, and the remove method was quite challenging....
user avatar
  • 1,180
3 votes
1 answer
320 views

BST implementation using smart pointers in C++

This BST implementation seems to work, I would appreciate an advice on how to improve the code. I am also interested in the following: rule-of-5 methods, are all of them necessary (e.g. is ...
user avatar
3 votes
2 answers
311 views

C word frequency counter

I write this program based on the algorithm of the word frequency counter program on the K&R book, page 139. I added some idioms of mine, some command-line options, and a dynamically allocable ...
user avatar
  • 854
2 votes
1 answer
54 views

LeetCode: Increasing Order Search Tree C#

https://leetcode.com/problems/increasing-order-search-tree/ Please review for performance Given a binary search tree, rearrange the tree in in-order so that the leftmost node in the tree is now ...
user avatar
  • 5,249