Shulou(Shulou.com)05/31 Report--

This article will explain in detail what is the concept of binary tree in python. The content of the article is of high quality, so the editor will share it with you for reference. I hope you will have some understanding of the relevant knowledge after reading this article.

About trees: a binary tree in which each node happens to have zero or two child nodes.

Perfect binary tree: a binary tree with the same depth of all leaf nodes. The degree of all internal nodes is 2

Full binary tree: each node has 0 or 2 children.

Perfect binary tree: all leaves have the same depth, and all internal nodes have 2 children

The difference between a complete binary tree and a complete binary tree:

(1) the binary tree T is full if each node is a leaf or happens to have two child nodes.

(2)。 If all levels except the last level are fully full and all nodes of the last level are on the left, the binary tree T with n levels is complete.

The difference between a full binary tree and a complete binary tree:

The full binary tree is every node, either with leaves or with 2 children.

Complete binary tree: each layer is complete, except the last layer, and all the nodes of the last layer are on the left.

AVL tree: AVL tree is a self-balanced binary search tree. These trees are based on two inventors, G.M. Adel Senvelski and E.M. Named after Landis. [3]

Height / depth of the tree: the height of the node is the length of the longest downward path from the node to the leaf. The height of the root is the height of the tree.

The depth of a node is the length of the path to its root (that is, its root path).

This is usually required when manipulating various self-balancing trees, especially AVL trees. The depth of the root node is zero, the height of the leaf node is zero, and the depth and height of the tree with only one node (so roots and leaves) is zero. Traditionally, empty trees (trees without nodes, if allowed) have depth and height − 1. [4]

The depth of the root is 0 and the height of the leaf is 0. The depth height of a tree with only one node is 0. 0. By convention, the depth and height of an empty tree are both-1

About what the concept of binary tree in python is shared here, I hope the above content can be of some help to you, can learn more knowledge. If you think the article is good, you can share it for more people to see.

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.