【DataStrcutre】Introduction and description of Binary Trees
2017-04-19 12:58
405 查看
[Definitions]
Here is the recursive definition of a binary tree:A binary tree is either the empty set or a triple T = (x,L,R), where x is a node and L and R are disjoint binary trees, neither of which contains.
The node x is called the root of the tree T, and the subtrees L and R are called the left subtree and the right subtree of T rooted at x.
Here is an equivalent, nonerecursive defination for binary trees:
A binay tree is an ordered tree in which every internal node has degree 2.
Full Binary Trees
A binary tree is said to be full if itls leaves are at the same level and every interior node has two children.相关文章推荐
- 【DataStrcutre】Introduction and description of Binary Trees
- 【DataStructure】Description and Introduction of Tree
- 【DataStructure】Description and Introduction of Tree
- 优秀课件笔记之重要类型旅游地介绍与分析Introduction and Analysis of Tourist Destinationsof Destinations
- [Java代码] [Leetcode] Maximum and Minimum Depth of Binary Tree 二叉树的最小最大深度
- Lintcode: Binary Tree Serialization (Serialization and Deserialization Of Binary Tree)
- Algorithm: Binary Tree(2) -- Special Trees (BST and Balanced Tree)
- Application binary interface and method of interfacing binary application program to digital computer
- Leetcode_minimum-depth-of-binary-tree (c++ and python version)
- Amazon AWS service category and introduction of EMR
- 【DataStructure】Description and usage of queue
- Some books recommended, and also a simple introduction of myself.
- 数据结构:Binary and other trees(数据结构,算法与应用(C++语言描述)第8章)
- Introduction to the Algebra and Geometry of Euclidean Space
- 优秀课件笔记之重要类型旅游地介绍与分析Introduction and Analysis of Tourist Destinationsof Destinations 2
- Maximum and Minimum Depth of Binary Tree 二叉树的最小最大深度 [java]
- Algorithm: Binary Tree(2) -- Special Trees (BST and Balanced Tree)
- C#数据结构和算法 [Binary Trees and Binary]
- This function has none of DETERMINISTIC, NO SQL, or READS SQL DATA in its declaration and binary log
- An Introduction to Language Processing with Perl and Prolog: An Outline of Theories, Implementation,