This week's book giveaway is in the Artificial Intelligence and Machine Learning forum.We're giving away four copies of Zero to AI - A non-technical, hype-free guide to prospering in the AI era and have Nicolò Valigi and Gianluca Mauro on-line!See this thread for details.
Win a copy of Zero to AI - A non-technical, hype-free guide to prospering in the AI era this week in the Artificial Intelligence and Machine Learning forum!

Greenhorn
since Oct 10, 2020
Cows and Likes
Cows
0
In last 30 days
0
Total given
0
Likes
0
0
Total given
0
Given in last 30 days
0
Scavenger Hunt
Ranch Hand Scavenger Hunt
Greenhorn Scavenger Hunt

## Recent posts by eden gilad

1 week ago
the complexity is o(1)?
1 week ago
The vertex of a binary tree is called an single child if it has a father's vertex but does not have a neighbor.

The root is not considered an single child.

let mark in  numOnly  a number of vertices in T that hold the attribute "single son ", and ‘with n we mark the total number of vertices in the T tree.
Is it true that every binary tree called "T" if numOnly/n<=0.5
then the height of "T" maintains the condition: height(T)=O(logn)?
1 week ago
i mean in pseudo code
1 week ago
You can show me in code?
1 week ago
how do i merge two minimum-heaps to one heap in efficiency?
public static MinHeap mergeTwoHeaps(MinHeap h1, MinHeap h2){….}
1 week ago
how do i merge two minimum-heaps to one heap in efficiency?
public static MinHeap mergeTwoHeaps(MinHeap h1, MinHeap h2){….}
1 week ago
finding the maximum elememt in min heap when all the elements are different
1 week ago

Where can  min heap be a maximum elememt, when all the elements are different?
1 week ago
i think also they mean the maximum number of  nodes from the root to ANY of the leaves.
1 week ago
T is a binary tree with "n" vertices. "maxSum" is the maximum amount of The keys in the path from the root to the leaf. Write a recursive static function that takes a binary tree and returns the largest set of keys. I dont know how to continue this code :
class Node{
String data;
Node left, right;
boolean val;
Node(String data){
this.data = data;
this.left = null;
this.right = null;
val = false; //help field
}
public String toString(){return ""+data;}
public String getData() {return data;}
public Node getLeft() {return left;}
public Node getRight() {return right;}
}// Node
public class BinaryTree {
private Node root;
public BinaryTree() {this.root = null;}
public static Integer maxSum(BinaryTree tree) {. . .}
1 week ago