I was just experimenting with binary trees and I was wondering how I would implement dynamic memory in my solution. From what I have read all you need to do is that instead of declaring a tree node ...

To preface, I am using Entity Framework 6 with a code first approach.
I created a simple binary tree node class for storing a series of 'rules'. I want to store the tree as an object in the database ...

please suggest MySQL database design for a typical multilevel marketing software design.
the design i choose was
user_id|parent_id|placement|join_date
but it is very difficult to get genealogy from ...

I've been trying to get the test cases on OJ Leetcode to pass for validating a BST using level order traversal and it's not passing. I'm passing 73/74 and can't figure out why. Any advice to point me ...

When inserting a node into this binary tree(that doesn't accept duplicates) for whatever reason the root is not being set and even weirder is the fact that the root node seems to be set to whatever ...

I am creating a binary tree program at the moment and I have implemented quite a few functions so far. I would now like to add a function to create an empty tree but I haven't been able to figure out ...

i'm trying to compare all leafs to return the lowest value of a tree, I don't have main function just a script to insert values so unfortunately I can't debug it.
tpNoArvore * findLowest(tpNoArvore ...

I am creating a binary tree program and I would like to overload a few operators. I have tried overloading the + operator so that when I write something like myTree + 5, it would add 5 as a node on ...

So I created a simple binarySearch tree class with an inner private Node class which defines the nodes and its children internally (left, right). I understand for the most part on how to implement one ...

I've got to implement a form of binary tree where it shows a hierarchy of employment where a boss is the trees root and a lesser employee is the left node and the right node is an employee of the same ...

Okay so for this assignment I have to define a recursive function that takes a binary number tree and returns the number of leaves that have even numbers on them. The function I have to far looks like ...

I have an array suppose {10,1,10,9}
Now I have to a form a binary tree with start node as array[0] which is 10 here, the tree structure will be like this
first element 10
here in the picture, first ...

How do I declare the tree_search function in the main ? I have tried to do it but i keep getting some weird results. What I want to do is search for node 0,11 in the binary tree and display it if it ...

I wrote a recursive function for finding the min value of a binary tree (assume that it is not ordered).
The code is as below.
//assume node values are positive int.
int minValue (Node n) {
if(n == ...

Count the number of identical trees in a given Tree, where a tree is said to be identical if the values of its node is same as its the value of all its children nodes, We can make the assumption that ...

I need to search any combination of numbers in the BinaryTree that will give me the sum I am searching for.
For example, for the tree that have the numbers: 9,1,6,3,2,5 if the system will receive the ...

I have been using C# for about a year now, I am attempting to move on to C++ in visual studio. Anyway I am trying to make a generic binary tree in C++ and have run into a few compile errors which I ...

This link show a binary tree, where I want to get exactly one node from every path between the root and the leafs.
E.g. for the tree represented in the above link, I want to output the following set ...

I'm writing a program that's supposed to populate ten random trees with 1000 random values, ranging from 0 to 300. This is the code of my tester class. When I run this program, however, it prints out ...

This is an interesting question I just had on a test that I can't figure out the answer to. Assume you have a binary search tree. You traverse through it and copy the contents to a data file. Then you ...

I'm running a computation on via a shader(inside of unity) and this computation requires several binairy trees to be writen into a texture (specifically 2048 binairy trees each containing 2048 nodes). ...