LYCOS RETRIEVER 
Binary Tree
built 235 days ago
Binary Tree is the leading provider of Messaging and Migration products for Lotus Notes/Domino and Microsoft Exchange. Binary Tree’s Common Migration Tool (CMT™) family of products has been used by thousands of companies to migrate several million mailboxes as well as to migrate, consolidate, and/or enhance existing Lotus Notes and Domino infrastructures.
Source:
The DSW algorithm is ... useful pedagogically within a course on data structures where one progresses from the binary search tree into self-adjusting trees, since it gives a first exposure to doing rotations within a binary search tree. These rotations then are found in AVL trees and various other methods for maintaining binary search trees for efficient access (such as red-black trees).
Source:
This article introduces the basic concepts of binary trees, and then works through a series of practice problems with solution code in C/C++ and Java. Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms.
Source:
Design a method that determines whether two binary trees are identical. This method takes a second binary tree as its only parameter, and returns a boolean value: true if the tree receiving the message is identical to the parameter, and false otherwise. Use Java’s equals message to determine whether the trees’ roots are equal.
Source:
This will clean up the underlying Tree::Binary object by calling DESTROY on its root node. This is necessary to properly clean up circular references. See the documentation for Tree::Binary, specifically the "CIRCULAR REFERENCES" section for more details.
Source:
This program is an educational tool for showing the operations of a Binary-Tree. More specifically, it graphically demonstrates the Binary-Tree node layout, key value searching, node deletions, node additions, and splay balancing. It ... provides a description of the processes.
Source:
MORE ABOUT
Binary Tree