Description: //Binary_tree.cpp : implementation file for generating all the binary tree
//The purpose of this C++ Program is to generate all the binary trees given the node number.
//The basic idea is to evolve all the binary trees from the degenerate tree.
//The algorithm is motivated by the parenthesis representation of binary trees.
//The parenthesis set can be organized through lexicographical order. But the algorithm
//in the code has not simply converted from parenthesis representation instead
//it has kept on shifting the last node from the latest binary tree to the next
//possible left handside position(here we assume the degenerate tree is right handside).
//This file has also computed the memory reference times(read/write) and avarage
//reference times.
//
//This program works in microsoft visual studio 2005 environment.
To Search:
- [Robson] - Robson Traversal Write and test a modifi
- [strahler_number] - This project has computed the Strahler n
- [AdaBoost] - This powerpoint has discussed the backgr
- [robson] - To create a binary tree, the latter algo
File list (Check if you may need any files):
Binary_Tree
...........\Binary_tree.cpp
...........\Binary_tree.h
Download