69 CS651 Lecture : DSA notes 42
Document Summary
Lesson 42 | dsa in java | java for. It can point to a maximum of two nodes. one node in a binary tree, which is not a children of any other node is called a root. Leaf nodes are the nodes which have zero children, which are basically they have two children all the other nodes are directly and also indirectly children of other nodes. If you look at any o ther nodes, let "s say we are talking about 11 There are total of four leaf nodes in our binary tree. a root node can be leaf node itself only if there is only one node present in the binary team music, so let. "s look at some other terms level height and depth so first we "ll be covering what is height binary tree height. this is level and height.