:)
There is one thing you might enjoy having as you move to the balance code. You may enjoy visualizing the resulting tree.
Here's a link (there are so many) you might be able to interpret. The node is exactly like your Bin_Node, but the code is C++. It is, however, barely C++. You should be able to re-interpret this to visualize the tree on a text display.
Print Binary Tree Structure with its contents in C++ - Techie Delight
AVL tree - Wikipedia
For those not in the know about AVL Tree; I forgot all about them. Did remember a little about red–black trees.
cooper1200: I am playing around with your code to remind myself about binary trees; it has been decades since I wrote a binary tree and I forgot a lot.
Tim S.
am i right in thinking that the new key word in c++ is the equiverlant of malloc in c ie it assigns a chunk of memory
what im scratching my head about is the four cases...
left left = right rotation
left right = right then left rotation
right right = left rotation
right left = left right rotation.
i get that its just a rule one has to remember what i don't understand is how one decides which node should be come the parent node. and how one visualises what it looks like
Yes, you need to replace the new with malloc and the delete with free.Quote:
Originally Posted by cooper1200
Tim S.
This is a tricky one to answer for you, because you are intending to develop code on the Arduino...Quote:
am i right in thinking that the new key word in c++ is the equiverlant of malloc in c ie it assigns a chunk of memory
The Arduino does not fully implement the C++ standard, so "new" is litterally this...
ArduinoCore-samd/new.cpp at master * arduino/ArduinoCore-samd * GitHub
However, when using "new" in C++ world it runs something called a "constructor" as well as allocating memory.
Are you sure Arduino's "new" operator doesn't call the class's constructor? It's my understanding that "operator new" is responsible only for allocating memory, and the compiler will generate the code needed to call the constructor after calling "operator new".Quote:
Originally Posted by Click_here
It used to be a problem, but my info might be out dated...
You might need to fact check that one!
O_o
The `operator new` function and the `new` operator are different beasts.
If the compiler behaves properly (I have no idea as I don't recall.) with respect to the `new` operator, the implementation of the `operator new` function is basically irrelevant as the `new` operator is responsible for calling constructors and associated destructor in the event of an exception.
Soma
They are similar, yes, in that they both allocate memory that must be released by the matching keyword (delete for new, free for malloc).Quote:
Originally Posted by cooper1200
As for calling the constructor, that's part of what new does - but you can override 'new' in a class for customized allocation and construction, or use something called "in place new", which constructs an object in an existing location without allocation.
im sorry to be think but if new allocates memory as well as the "constructor" surely the main in this example Print Binary Tree Structure with its contents in C++ - Techie Delight is completely wrong as far as following the rules of a binary tree
What makes you think that it "is completely wrong as far as following the rules of a binary tree"?
well from what i understand keeping in mind i don't know c++ we start with a root node (in this case 1) then anything smaller than it should go on the left and anything bigger than it should go on the right so in the example they have the 2 going to the left of 1 ok they might of decided to flip the "rule" so the 2 would go to the left. but next line they but the three on the right of the 1.
You're thinking of a binary search tree. That example is of a binary tree.
It's like saying that inserting into an array by appending is wrong because you must insert to maintain sorted order. Of course not: that's for a sorted array, not an array in general.
so i have been studying binary search trees not binary trees....