Binary Trees: A binary tree T is defined set of elements, called nodes, such that:
(a) T is empty (called the null tree or empty tree), or
(b) T constants a distinguished node R, called the root of T, and the remaining nodes of T form an ordered pair of disjoint binary trees T1 and T2.
If T does contain a root R, then the two trees T1 and T2 are called, respectively, the left and right subtrees of R. If T1 is nonempty, then its root is called the left successor of R; If T2 is nonempty, then its root is called the right successor of R.
If You want to learn about the technology, computer science & engineering, web programming, freelancing, earning please click here :CSE SOLVE
(a) T is empty (called the null tree or empty tree), or
(b) T constants a distinguished node R, called the root of T, and the remaining nodes of T form an ordered pair of disjoint binary trees T1 and T2.
If T does contain a root R, then the two trees T1 and T2 are called, respectively, the left and right subtrees of R. If T1 is nonempty, then its root is called the left successor of R; If T2 is nonempty, then its root is called the right successor of R.
Posts
0 comments:
Post a Comment