I wrote a dictionary class of an avl search tree with values in leaves, but it is necessary to add immutability to it, that is, when deleting and addi ...

There was a task in school: to implement a dictionary based on an AVL-balanced search tree, in which data is stored in leaves. I wrote a dictionary c ...

I am aware that there are certain methods to create an AVL tree online. However, I am trying to do it with a different method. The problem that I am f ...

I want to create AVL tree with following structure I created my AVL tree according to "a" value, I mean it is sorted according to this value. Howev ...

Let's say I delete the root node (6), how do I rebalance the tree? Is rebalancing the tree related to a left or right rotation? Would it be differe ...

I'm new to programming and I have an assignment. My homework is related to a balanced binary search tree. I had a few problems with some methods, I wo ...

For this assignment I'm not allowed to edit the method or the calling of it in the driver code, and it only takes a self argument. I'm having a bit of ...

I don't know, why _clear don't remove elements from a tree. Probably, needs to override destructor. There are stay NULL linked nodes, why they don' ...

Can someone please help me with AVL Trees, I think I'm doing it wrong when computing the new balance in rotationRightLeft function. I'm not allowed to ...

I am seeking a way to recursively maintain the parent pointer in my AVL tree insert. I am aware that this is not the usual process however I am meant ...

I keep seeing the balance factor of a binary tree defined differently. My textbook and the Wikipedia AVL Tree page define it as: Yet other places ...

Can someone help me, how I could traversal a balanced binary tree in order without recursion, stack, or morris traversal. I want to traverse it iterat ...

A function is given with a method to get the next integer from a stream of integers. The numbers are fetched sequentially from the stream. How will we ...

What is the advantage of a B-tree over binary search tree and AVL trees? ...

Sorry if this is a dumb question, I'm relatively new with Rust and just can't crack this double mutable borrowing error. I'm trying to create an AVL t ...

I have implemented an AVL tree, but I have a problem. Suppose I have following tree, which of the both solutions for balancing are correct? Solution ...

I have an empty AVL Tree and two AVL Trees. I want to get the union of both trees. I do so using an inorder traversal of both trees and inserting (O(l ...

Im trying to build an AVL/Binary tree, but was not able to find a lot of code examples, only theory. My implementation for some reason has the AVL rot ...

From my understanding, a complete tree is a balanced tree that may not be AVL balanced. A complete tree is one where all levels are completely filled ...

I'm learning data structures, and I'm building an AVL tree class. I want to traverse the tree by saving the elements in one string. I already built th ...