首页 > 代码库 > 【DataStrcutre】Introduction and description of Binary Trees
【DataStrcutre】Introduction and description of Binary Trees
[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.
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。