文件名称:Binary_Tree
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:3.11kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Binary_tree.cpp :执行文件生成所有二叉树
这样做的目的C + +程序是产生所有二叉树指定节点数目。
基本思想是衍生所有二叉树基于退化树。
该算法的动机是圆括号法则代表二叉树。
一组括号可通过字典秩序排列,由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性 它一直在改变过去的节点从最新二叉树下一可能位置(在这里,我们假设右向是正确的退化树方向) 。
该文件还提到计算机内存时(读/写)和avarage参考值。
这个工程在Microsoft Visual Studio 2005环境。-//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.
这样做的目的C + +程序是产生所有二叉树指定节点数目。
基本思想是衍生所有二叉树基于退化树。
该算法的动机是圆括号法则代表二叉树。
一组括号可通过字典秩序排列,由此也可以产生二叉树。但该算法代码中并没有简单地转换括号代表性 它一直在改变过去的节点从最新二叉树下一可能位置(在这里,我们假设右向是正确的退化树方向) 。
该文件还提到计算机内存时(读/写)和avarage参考值。
这个工程在Microsoft Visual Studio 2005环境。-//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.
相关搜索: Lexicographical Order
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Binary_Tree/
Binary_Tree/Binary_tree.h
Binary_Tree/Binary_tree.cpp
Binary_Tree/Binary_tree.h
Binary_Tree/Binary_tree.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.