binary-tree

How do you compute the average height of a binary search tree when adding 1000 random ints? What is the average height? You can compute the height of a binary tree using this recursive definition: height(empty) = 0 height(tree) = 1 + max(height(tree.left), height(tree.right)) One way to empirically measure the average height of such a tree is to repeatedly create an empty tree and add 1000 random items to it. Measure the height of each trial using the above function, and average them. I suspect your task is probably to find a formula for the average height of a binary tree. Andrew Shepherd

A complete binary tree is defined as a binary tree in which every level, except possibly the deepest, is completely filled. At deepest level, all nodes must be as far left as possible. I'd think a simple recursive algorithm will be able to tell whether a given binary tree is complete, but I can't seem to figure it out. Similar to: height(t) = if (t==NULL) then 0 else 1+max(height(t.left),height(t.right)) You have: perfect(t) = if (t==NULL) then 0 else { let h=perfect(t.left) if (h != -1 && h==perfect(t.right)) then 1+h else -1 } Where perfect(t) returns -1 if the leaves aren't all at the same

I have been given two binary search trees. For example, A and B. Next, I was asked to delete the tree B from the tree A. By deletion, I mean delete all the nodes present in B from A. Note: B is not necessarily a subtree of A. eg: A: 50 / \ 10 75 / / \ 1 60 90 B: 10 / \ 1 75 Resulting tree should be: 50 \ 60 \ 90 Two approaches came to my mind: A1: node* deleteTree(node* A, node* B) ; Take the root of tree B. Delete this node from tree A(by normal BSt deletion method). Next divide the problem into two parts - for the left subtree of B and the right subtree of B. For each of the subtree, recurse

I am constructing a binary tree. Let me know if this is a right way to do it. If not please tell me how to?? I could not find a proper link where constructing a general binary tree has been coded. Everywhere BST is coded. 3 / \ 1 4 / \ 2 5 This is the binary tree which i want to make.I should be able to do all the tree traversals.Simple stuff. public class Binarytreenode { public Binarytreenode left; public Binarytreenode right; public int data; public Binarytreenode(int data) { this.data=data; } public void printNode() { System.out.println(data); } public static void main(String ar[]) {