One. It is called root.
Chat with our AI personalities
A B-Tree can be described as a tree that has many nodes up, as well as many nodes down. A B-Tree not only has an order but they also have keys and pointers.
If N>1, there are (2N-1) - (2N-1-1), otherwise, 1 nodes in the Nth level of a balanced binary tree.
For a full binary tree of height 3 there are 4 leaf nodes. E.g., 1 root, 2 children and 4 grandchildren.
A binary tree with n nodes has exactly n+1 null nodes or Null Branches. so answer is 21. MOHAMMAD SAJID
3