Saved Bookmarks
| 1. |
Define A Binary Tree? |
|
Answer» A BINARY tree is a finite set of NODES which is either EMPTY or consists of a root and two disjoint binary trees called the LEFT sub-tree and right sub-tree. A binary tree is a finite set of nodes which is either empty or consists of a root and two disjoint binary trees called the left sub-tree and right sub-tree. |
|