【DataStrcutre】Introduction and description of Binary Trees
来源:互联网 发布:怎么进淘宝卖家中心 编辑:程序博客网 时间:2024/06/07 09:16
[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.
0 0
- 【DataStrcutre】Introduction and description of Binary Trees
- 【DataStructure】Description and Introduction of Tree
- Introduction to Binary Space Partition Trees
- 1003. Width of Binary Trees
- description of USB class,subclass and protocol
- 【DataStructure】The description and usage of Stack
- 【DataStructure】Description and usage of queue
- Description of graph6 and sparse6 encodings
- No. 12 - Mirror of Binary Trees
- C#数据结构和算法 [Binary Trees and Binary]
- the introduction of gcc and g++
- The introduction and application of PLC
- The Introduction of Windows Programming and WTL
- Introduction to Boosted Trees
- Introduction to Boosted Trees
- 【MonogDB】The description of index(二) Embedded and document Index
- 【MonogDB】The description of index(三) Compose and unique Index
- Availability and description of the File Checksum Integrity Verifier utility
- Java进阶之欧拉工程 第十四篇【 最长的collatz序列】
- 数据结构:堆
- Adapter——notifyDataSetChanged
- uva 1546 - Complete the sequence!(牛顿插值法)
- 关于STM32中RTC的校准方法
- 【DataStrcutre】Introduction and description of Binary Trees
- HDOJ 题目2973 YAPTCHA(数学,威尔逊定理)
- HT图形组件设计之道(三)
- PAT 1043. Is It a Binary Search Tree (25)
- Cocos2d-x层(Layer)动画的实现
- 记一些琐碎的东西
- Scala学习笔记
- [Docker]初次接触
- uva 684 - Integral Determinant(行列式求值)